On Exploring Temporal Graphs of Small Pathwidth
classification
💻 cs.DS
cs.CC
keywords
graphpathwidthtemporalconnectedcurrentevenexplorationexploring
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.