Exploration of k-edge-deficient temporal graphs in linear time
We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal constraints can substantially increase exploration time even when every snapshot of the gr...
Ivan Lahtin, Viktor Zamaraev
· Discrete Mathematics · 0 citations