Tight bounds on distributed exploration of temporal graphs
Temporal graphs (or evolving graphs) are time-varying graphs where time is assumed to be discrete. In this paper, we consider for the first time the problem of exploring temporal graphs of arbitrary unknown topology. We study the feasibility of exploration, under both the Fsync and Ssync schedulers, focusing on the number of agents necessary and sufficient to explore such graphs. We first consider the minimal (i.e., less restrictive) assumption on the dynamics of the graph under which exploration is still feasible: temporal connectivity. Let H be the class of temporally connected graphs; we show that for any temporal graph G ∈ H the number of agents sufficient to perform exploration is related to the number of its transient edges, a parameter η(G) we call evanescence of the graph. More precisely, any G ∈ H can be explored by a team of k ≥ 2η(G) + 1 agents; this bound is tight as we prove there are G ∈ H that cannot be explored by 2η(G) agents. We then turn our attention to the well-known stronger assumption on the dynamics of the graph, called 1-interval connectivity: the graph is connected at any time step. Let W ⊂ H be the class of these always-connected temporal graphs. For this class, we prove the existence of a difference between Fsync and Ssync when there is a bound ` on the number of edges missing at each time. In fact, we show a tight bound of 2` + 1 on the number of agents necessary and sufficient in Ssync, and a smaller tight bound of 2` in Fsync. As a corollary, we re-establish two recently published bounds for 1-interval connected rings.
|, , ,|
|23rd International Conference on Principles of Distributed Systems, OPODIS 2019|
|Organisation||School of Computer Science|
Gotoh, T. (Tsuyoshi), Flocchini, P. (Paola), Masuzawa, T. (Toshimitsu), & Santoro, N. (2020). Tight bounds on distributed exploration of temporal graphs. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.OPODIS.2019.22