On Finding Separators in Temporal Split and Permutation Graphs

Nicolas Maack, Hendrik Molter, Rolf Niedermeier +1

Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separatio…