Summary: A temporal graph is a graph in which the edge set can change from step to step. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. We consider only temporal graphs that are connected at each step. For such temporal graphs with \(n\) nodes, we show that it is \(\mathbf {NP}\)-hard to approximate TEXP with ratio \(O(n^{1-{\varepsilon} })\) for any \({\varepsilon} >0\). We also provide an explicit construction of temporal graphs that require \({\Theta} (n^2)\) steps to be explored. We then consider TEXP under the assumption that the underlying graph (i.e. the graph that contains all edges that are present in the temporal graph in at least one step) belongs to a specific class of graphs. Among other results, we show that temporal graphs can be explored in \(O(n^{1.5}k^2\log n)\) steps if the underlying graph has treewidth \(k\) and in \(O(n\log ^3 n)\) steps if the underlying graph is a \(2 {\times} n\) grid. We also show that sparse temporal graphs with regularly present edges can always be explored in \(O(n)\) steps.
For the entire collection see [Zbl 1316.68014].