We consider, for the first time, the exploration of dynamic graphs of arbitrary unknown topology. We study the number of agents necessary and sufficient to explore such graphs under the fully synchronous (Fsync) and the semi-synchronous (Ssync) activation schedulers. We prove that, under the minimal assumption on the dynamics, temporal connectivity, the number of agents sufficient to perform exploration depends on a parameter we call evanescence of the graph, and this number is tight. We then consider the stronger well-known assumption of 1-interval connectivity when the number of edges missing at each time is bounded. We provide tight bounds also in this setting, proving the existence of a difference between Fsync and Ssync, as well as between anonymous and non-anonymous agents.

我们第一次考虑探索任意未知拓扑的动态图。我们研究了在完全同步 ( Fsync ) 和半同步 ( Ssync ) 激活调度程序下探索此类图所必需和足够的代理数量。我们证明，在动力学的最小假设下，时间连通性，足以执行探索的代理数量取决于我们称为图消逝的参数，并且这个数字很紧。然后我们考虑更强的众所周知的1-区间连通性假设当每次丢失的边数是有界时。我们也在这个设置中提供了严格的界限，证明Fsync和Ssync之间以及匿名和非匿名代理之间存在差异。