Log In Sign Up

Restless Temporal Path Parameterized Above Lower Bounds

by   Philipp Zschoche, et al.

Reachability questions are one of the most fundamental algorithmic primitives in temporal graphs – graphs whose edge set changes over discrete time steps. A core problem here is the NP-hard Short Restless Temporal Path: given a temporal graph 𝒢, two distinct vertices s and z, and two numbers δ and k, is there a δ-restless temporal s-z path of length at most k? A temporal path is a path whose edges appear in chronological order and a temporal path is δ-restless if two consecutive path edges appear at most δ time steps apart from each other. Among others, this problem has applications in neuroscience and epidemiology. While Short Restless Temporal Path is known to be computationally hard, e.g., it is NP-hard for only three time steps and W[1]-hard when parameterized by the feedback vertex number of the underlying graph, it is fixed-parameter tractable when parameterized by the path length k. We improve on this by showing that Short Restless Temporal Path can be solved in (randomized) 4^k-d|𝒢|^O(1) time, where d is the minimum length of a temporal s-z path.


page 1

page 3

page 13

page 15


Restless reachability problems in temporal graphs

We study a family of reachability problems under waiting-time restrictio...

Disentangling the Computational Complexity of Network Untangling

We study the network untangling problem introduced by Rozenshtein, Tatti...

Finding Balance-Fair Short Paths in Graphs

The computation of short paths in graphs with edge lengths is a pillar o...

Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring

We consider the algorithmic complexity of recognizing bipartite temporal...

Interference-free Walks in Time: Temporally Disjoint Paths

We investigate the computational complexity of finding temporally disjoi...

Temporal Graph Classes: A View Through Temporal Separators

We investigate the computational complexity of separating two distinct v...

On Finding Separators in Temporal Split and Permutation Graphs

Removing all connections between two vertices s and z in a graph by remo...