English

On Exploring Temporal Graphs of Small Pathwidth

Data Structures and Algorithms 2018-08-01 v1 Computational Complexity
Authors: Hans L. Bodlaender , Tom C. van der Zanden
View on arXiv ↗ PDF ↗

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.

Keywords

graph theory planar graph drawing

Cite

@article{arxiv.1807.11869,
  title  = {On Exploring Temporal Graphs of Small Pathwidth},
  author = {Hans L. Bodlaender and Tom C. van der Zanden},
  journal= {arXiv preprint arXiv:1807.11869},
  year   = {2018}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
On Temporal Graph Exploration
Thomas Erlebach, Michael Hoffmann, Frank Kammer
2021-03-17
Discrete Mathematics · Computer Science
Tracking Paths in Planar Graphs
David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias
2019-10-01
Computational Complexity · Computer Science
On the Hardness of Finding Temporally Connected Subgraphs of Any Size
Arnaud Casteigts, Christian Komusiewicz, Nils Morawietz
2026-04-28
Data Structures and Algorithms · Computer Science
The Complexity of Finding Small Separators in Temporal Graphs
Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2018-07-26
Discrete Mathematics · Computer Science
Temporal Connectivity Augmentation
T. Bellitto, J. Bouton Popper, B. Escoffier
2025-02-21
Data Structures and Algorithms · Computer Science
Minimum Temporal Spanners in Happy Graphs
Arnaud Casteigts, Hendrik Molter, Meirav Zehavi
2026-04-28
Optimization and Control · Mathematics
The Shortest Temporal Exploration Problem
Stefan Balev, Éric Sanlaville, Antoine Toullalan
2025-04-10
Computational Complexity · Computer Science
On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems
Max-Jonathan Luckow, Till Fluschnik
2019-05-28
Data Structures and Algorithms · Computer Science
Matching and Edge Cover in Temporal Graphs
Lapo Cioni, Riccardo Dondi, Andrea Marino, Jason Schoeters +1
2025-04-10
Data Structures and Algorithms · Computer Science
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
2024-03-22
Combinatorics · Mathematics
A Graph Minors Approach to Temporal Sequences
Johannes Carmesin, Will J. Turner
2025-04-02
Data Structures and Algorithms · Computer Science
Testing Temporal Connectivity in Sparse Dynamic Graphs
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen +1
2014-08-06
Data Structures and Algorithms · Computer Science
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti +1
2023-04-04
Data Structures and Algorithms · Computer Science
Cutting a tree with Subgraph Complementation is hard, except for some small trees
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
2022-08-23
Data Structures and Algorithms · Computer Science
Parameterized temporal exploration problems
Thomas Erlebach, Jakob T. Spooner
2022-12-06
Data Structures and Algorithms · Computer Science
Minimum length path decompositions
Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
2021-03-05
Disordered Systems and Neural Networks · Physics
The number of guards needed by a museum: A phase transition in vertex covering of random graphs
Martin Weigt, Alexander K. Hartmann
2009-10-31
Data Structures and Algorithms · Computer Science
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup +1
2024-07-19
Data Structures and Algorithms · Computer Science
Exploration of $k$-edge-deficient temporal graphs in linear time
Ivan Lahtin, Viktor Zamaraev
2026-05-18
Computational Complexity · Computer Science
NP-complete variants of some classical graph problems
Per Alexandersson
2020-01-14
Data Structures and Algorithms · Computer Science
Interference-free Walks in Time: Temporally Disjoint Paths
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier +1
2021-05-25
Discrete Mathematics · Computer Science
Contracting Bipartite Graphs to Paths and Cycles
Konrad K. Dabrowski, Daniël Paulusma
2017-06-13
Combinatorics · Mathematics
The Complexity of Two Graph Orientation Problems
N. Eggemann, S. D. Noble
2010-04-15
Data Structures and Algorithms · Computer Science
Realization of Temporally Connected Graphs Based on Degree Sequences
Arnaud Casteigts, Michelle Döring, Nils Morawietz
2026-05-06
Computational Complexity · Computer Science
Temporal Vertex Cover with a Sliding Time Window
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2019-08-13
R2 v1 2026-06-23T03:20:31.122Z