The complexity of finding temporal separators under waiting time constraints

Open Webpage

Hendrik Molter

Published: 01 Jan 2022, Last Modified: 13 Jul 2025Inf. Process. Lett. 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•The paper introduces the problem “Restless Temporal Separation”, which asks whether all temporal paths between two vertices s and z in a temporal path that obey certain waiting time constraints can be destroyed by deleting at most k vertices from the temporal graph.•Restless Temporal Separation is Σ2P-complete.•Restless Temporal Separation parameterized by the separator size is para-coNP-hard and W[2]-hard.