Interference-free Walks in Time: Temporally Disjoint Paths

05/18/2021
by   Nina Klobas, et al.
0

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically increasing time steps. Two paths (or walks) are temporally disjoint if they never use the same vertex at the same time; otherwise, they interfere. This reflects applications in robotics, traffic routing, or finding safe pathways in dynamically changing networks. On the one extreme, we show that on general graphs the problem is computationally hard. The "walk version" is W[1]-hard when parameterized by the number of routes. However, it is polynomial-time solvable for any constant number of walks. The "path version" remains NP-hard even if we want to find only two temporally disjoint paths. On the other extreme, restricting the input temporal graph to have a path as underlying graph, quite counterintuitively, we find NP-hardness in general but also identify natural tractable cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/2023

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

A temporal graph has an edge set that may change over discrete time step...
research
09/13/2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints

Computing a (shortest) path between two vertices in a graph is one of th...
research
03/29/2022

Restless Temporal Path Parameterized Above Lower Bounds

Reachability questions are one of the most fundamental algorithmic primi...
research
02/13/2023

Snapshot disjointness in temporal graphs

In the study of temporal graphs, only paths respecting the flow of time ...
research
09/10/2019

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow

Let G=(V,E) be a multigraph with a set T⊆ V of terminals. A path in G is...
research
12/27/2018

On the Approximability of Time Disjoint Walks

We introduce the combinatorial optimization problem Time Disjoint Walks....
research
09/27/2020

The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs

The notion of forbidden-transition graphs allows for a robust generaliza...

Please sign up or login with your details

Forgot password? Click here to reset