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 $T$-interval-connected graphs, a standard model of dynamic networks in which, for every time window of length $T$, the inter…