On finding separators in temporal split and permutation graphs

Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We study the NP-hard TEMPORAL (s,z)-SEPARATION problem on temporal graphs, which are graphs with fixed vertex sets but edge sets that change over discrete time steps. We tackle TEMPORAL (s,z)-SEPARATION by restricting the layers (i.e., graphs characterized by edges that are present at a certain point in time) to specific graph classes. We restrict the layers of the temporal graphs to be either all split graphs or all permutation graphs (both being perfect graph classes) and provide both intractability and tractability results. In particular, we show that in general TEMPORAL (s,z)-SEPARATION remains NP-hard both on temporal split and temporal permutation graphs, but we also spot promising islands of fixed-parameter tractability particularly based on parameterizations that measure the amount of “change over time”.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalJournal of Computer and System Sciences
StatePublished - 1 Aug 2023


  • Connectivity problems
  • Fixed-parameter tractability
  • NP-hardness
  • Special graph classes
  • Temporal graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'On finding separators in temporal split and permutation graphs'. Together they form a unique fingerprint.

Cite this