TY - JOUR
T1 - Temporal graph classes
T2 - A view through temporal separators
AU - Fluschnik, Till
AU - Molter, Hendrik
AU - Niedermeier, Rolf
AU - Renken, Malte
AU - Zschoche, Philipp
N1 - Funding Information:
Supported by the DFG, project DAMM (NI 369/13) and TORE (NI 369/18).Supported by the DFG, project MATE (NI 369/17).
Funding Information:
Supported by the DFG, project DAMM (NI 369/13) and TORE (NI 369/18).Supported by the DFG, project MATE (NI 369/17). We thank the three reviewers of Theoretical Computer Science for their helpful and constructive feedback on the paper.
Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2020/2/2
Y1 - 2020/2/2
N2 - We investigate for temporal graphs the computational complexity of separating two distinct vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding TEMPORAL (s,z)-SEPARATION problem is NP-complete, it is natural to investigate whether relevant special cases exist that are computationally tractable. To this end, we study restrictions of the underlying (static) graph—there we observe polynomial-time solvability in the case of bounded treewidth—as well as restrictions concerning the “temporal evolution” along the time steps. Systematically studying partially novel concepts in this direction, we identify sharp borders between tractable and intractable cases.
AB - We investigate for temporal graphs the computational complexity of separating two distinct vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding TEMPORAL (s,z)-SEPARATION problem is NP-complete, it is natural to investigate whether relevant special cases exist that are computationally tractable. To this end, we study restrictions of the underlying (static) graph—there we observe polynomial-time solvability in the case of bounded treewidth—as well as restrictions concerning the “temporal evolution” along the time steps. Systematically studying partially novel concepts in this direction, we identify sharp borders between tractable and intractable cases.
KW - Dynamic programming
KW - Fixed-parameter tractability
KW - NP-completeness
KW - Temporal paths
KW - Temporal restrictions
KW - Unit interval graphs
UR - http://www.scopus.com/inward/record.url?scp=85063759473&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2019.03.031
DO - 10.1016/j.tcs.2019.03.031
M3 - Article
AN - SCOPUS:85063759473
SN - 0304-3975
VL - 806
SP - 197
EP - 218
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -