7 citations · 8 across the 7 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
The Complexity of Finding Temporal Separators under Waiting Time Constraints
Hendrik Molter
In this work, we investigate the computational complexity of Restless Temporal -Separation, where we are asked whether it is possible to destroy all restless temporal paths…
cs.CC2018
Temporal Graph Classes: A View Through Temporal Separators
Till Fluschnik, Hendrik Molter, Rolf Niedermeier +2
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…