Temporal graph classes: A view through temporal separators

Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche

Research output: Contribution to journalArticlepeer-review

31 Scopus citations


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.

Original languageEnglish
Pages (from-to)197-218
Number of pages22
JournalTheoretical Computer Science
StatePublished - 2 Feb 2020
Externally publishedYes


  • Dynamic programming
  • Fixed-parameter tractability
  • NP-completeness
  • Temporal paths
  • Temporal restrictions
  • Unit interval graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Temporal graph classes: A view through temporal separators'. Together they form a unique fingerprint.

Cite this