Temporal Graph Classes: A View Through Temporal Separators

Till Fluschnik
Till Fluschnik
Philipp Zschoche
Philipp Zschoche

WG, pp. 216-227, 2020.

Cited by: 18|Views2
EI

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...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments