On exploring always-connected temporal graphs of small pathwidth
DSpace/Manakin Repository
On exploring always-connected temporal graphs of small pathwidth
Bodlaender, Hans L.; van der Zanden, Tom C.
(2019) Information Processing Letters, volume 142, pp. 68 - 71
(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. show less