On Exploring Temporal Graphs of Small Pathwidth

07/31/2018

∙

by   Hans L. Bodlaender, et al.

∙

0

∙

share

We show that the Temporal Graph Exploration Problem is NP-complete, even when the underlying graph has pathwidth 2 and at each time step, the current graph is connected.