Temporal Graph Classes: A View Through Temporal Separators
WG, pp. 216-227, 2020.
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...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)