On Exploring Temporal Graphs of Small Pathwidth
Hans L. Bodlaender, Tom C. van der Zanden
TL;DR
This paper proves that exploring temporal graphs remains NP-complete even under constraints like small pathwidth and connectivity at each time step, highlighting computational challenges in such structured temporal graphs.
Contribution
It establishes NP-completeness of the Temporal Graph Exploration Problem for graphs with pathwidth 2 and connected snapshots, a previously unknown complexity result.
Findings
NP-completeness holds for pathwidth 2 graphs
Connectivity at each time step does not simplify the problem
Highlights computational difficulty in structured temporal graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Optimization and Search Problems · Interconnection Networks and Systems