3 papers
cs.DC2026
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
Yuichi Sudo, Naoki Kitamura, Masahiro Shibata +4
We study deterministic exploration by a single agent in -interval-connected graphs, a standard model of dynamic networks in which, for every time window of length , the inter…
cs.DC2025
The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata +1
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any…
cs.DC2024
Near-linear Time Dispersion of Mobile Agents
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
Consider that there are agents in a simple, connected, and undirected graph with nodes and edges. The goal of the dispersion problem is to move these …