The minimum window size for exploration is Θ(m) and exploration time is Θ(n^3) in KT0 and Θ(n^2) in KT1 models for T-interval connected graphs.
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
The minimum window size for exploration is Θ(m) and exploration time is Θ(n^3) in KT0 and Θ(n^2) in KT1 models for T-interval connected graphs.