The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints

09/13/2019
by   Arnaud Casteigts, et al.
0

Computing a (shortest) path between two vertices in a graph is one of the most fundamental primitive in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs where the vertex set remains static but the edge set may change over time, gained more and more attention. In a nutshell, temporal paths have to respect time, that is, they may only move forward in time. More formally, the time edges used by a temporal path either need to have increasing or non-decreasing time stamps. In is well known that computing temporal paths is polynomial-time solvable. We study a natural variant, where temporal paths may only dwell a certain given amount of time steps in any vertex, which we call restless temporal paths. This small modification creates a significant change in the computational complexity of the task of finding temporal paths. We show that finding restless temporal paths is NP-complete and give a thorough analysis of the (parameterized) computational complexity of this problem. In particular, we show that problem remains computationally hard on temporal graphs with three layers and is W[1]-hard when parameterized by the feedback vertex number of the underlying graph. On the positive side, we give an efficient (FPT) algorithm to find short restless temporal paths that has an asymptotically optimal running time assuming the Exponential Time Hypothesis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2021

The Complexity of Finding Temporal Separators under Waiting Time Constraints

In this work, we investigate the computational complexity of Restless Te...
research
02/17/2023

Realizing temporal graphs from fastest travel times

In this paper we initiate the study of the temporal graph realization pr...
research
05/27/2021

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

In static graphs, the betweenness centrality of a graph vertex measures ...
research
12/06/2018

On the Enumeration of Bicriteria Temporal Paths

We discuss the complexity of path enumeration in weighted temporal graph...
research
07/24/2023

As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy

In recent years, the study of various models and questions related to Li...
research
02/24/2022

Counting Temporal Paths

The betweenness centrality of a vertex v is an important centrality meas...
research
05/18/2021

Interference-free Walks in Time: Temporally Disjoint Paths

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

Please sign up or login with your details

Forgot password? Click here to reset