Exploration of $k$-edge-deficient temporal graphs in linear time

Ivan Lahtin, Viktor Zamaraev

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 graph…