On Exploring Temporal Graphs of Small Pathwidth

DSpace/Manakin Repository

On Exploring Temporal Graphs of Small Pathwidth
 
Bodlaender, Hans L.; van der Zanden, Tom C.
(2018) CoRR
(Article)
Abstract
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.
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: Graph algorithms, Computational complexity, Temporal graphs, Graph exploration, Pathwidth
(Non peer reviewed)
 
 
See more statistics about this item