Abstract
In this work, we investigate the computational complexity of Restless Temporal(s,z)-Separation, where we are asked whether it is possible to destroy all restless temporal paths between two distinct vertices s and z by deleting at most k vertices from a temporal graph. A temporal graph has a fixed vertex set but the edges have (discrete) time stamps. A restless temporal path uses edges with non-decreasing time stamps and the time spent at each vertex must not exceed a given duration Δ.Restless Temporal(s,z)-Separation naturally generalizes the NP-hard Temporal(s,z)-Separation problem. We show that Restless Temporal(s,z)-Separation is complete for Σ2P, a complexity class located in the second level of the polynomial time hierarchy. We further provide some insights in the parameterized complexity of Restless Temporal(s,z)-Separation parameterized by the separator size k.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
