@inproceedings{e44cb9a8ebdb4a49acc108f4d28f4176,
title = "Temporal graph classes: A view through temporal separators",
abstract = "We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. 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-hard, 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.",
author = "Till Fluschnik and Hendrik Molter and Rolf Niedermeier and Philipp Zschoche",
note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018 ; Conference date: 27-06-2018 Through 29-06-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-00256-5\_18",
language = "English",
isbn = "9783030002558",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "216--227",
editor = "Andreas Brandst{\"a}dt and Ekkehard K{\"o}hler and Klaus Meer",
booktitle = "Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings",
address = "Germany",
}