Exploration of 1-interval connected dynamic graphs with k agents is impossible if an adversary deactivates at least ceil(k/(n-2))-1 agents per round and is achievable if at most ceil(k/(n-2))-2 are deactivated, requiring 1-hop visibility and communication.
Das, Graph exploration with mobile agents, in: Chapter 16 of Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, 2019, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Semi-Synchronous Exploration in Dynamic Graphs
Exploration of 1-interval connected dynamic graphs with k agents is impossible if an adversary deactivates at least ceil(k/(n-2))-1 agents per round and is achievable if at most ceil(k/(n-2))-2 are deactivated, requiring 1-hop visibility and communication.