Search Results

Temporal graphs are a generalisation of (static) graphs, defined by a sequence of snapshots, each a static graph defined over a common set of vertices. Exploration problems are one of the most fundamental and most heavily studied problems on temporal graphs, asking if a set of m agents can visit every vertex in the graph, with each agent only allowed to traverse a single edge per snapshot. In this paper, we introduce and study always S-connected temporal graphs, a generalisation of always-connected temporal graphs where, rather than forming a single connected component in each snapshot, we have at most |S| components, each defined by the connection to at least one vertex in the set S. We use the model of always S-connected temporal graphs to study subgraphs of always-connected temporal graphs, with motivation coming from networks with a small number of "choke-points", such as rail networks, where all external traffic into a subnetwork comes from a limited number of external connections. We show that an always S-connected temporal graph with m = |S| and an average degree of Δ can be explored by m agents in O(n^{3/2} m³ Δ^{3/2} log^{3/2}(n)) snapshots, and, using this result as a subroutine, we show that any always-connected temporal graph with treewidth at most k can be explored by a single agent in O(n^{4/3} k^{11/2} log^{5/2}(n)) snapshots.