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.
Download/Full Text
The full text of this publication is not available.
 
Keywords: Computational complexity, Graph algorithms, Graph exploration, Pathwidth, Temporal graphs, Theoretical Computer Science, Signal Processing, Information Systems, Computer Science Applications
DOI: https://doi.org/10.1016/j.ipl.2018.10.016
ISSN: 0020-0190
Publisher: Elsevier
(Peer reviewed)
 
 
See more statistics about this item