eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2020-12-04
30:1
30:18
10.4230/LIPIcs.ISAAC.2020.30
article
Finding Temporal Paths Under Waiting Time Constraints
Casteigts, Arnaud
1
https://orcid.org/0000-0002-7819-7013
Himmel, Anne-Sophie
2
https://orcid.org/0000-0001-7905-7904
Molter, Hendrik
2
https://orcid.org/0000-0002-4590-798X
Zschoche, Philipp
2
https://orcid.org/0000-0001-9846-0600
LaBRI, Université de Bordeaux, CNRS, Bordeaux INP, France
Technische Universität Berlin, Algorithmics and Computational Complexity, Germany
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs where the vertex set is fixed but the edge set changes over time, gained more and more attention. A path is time-respecting, or temporal, if it uses edges with non-decreasing time stamps.
We investigate a basic constraint for temporal paths, where the time spent at each vertex must not exceed a given duration Δ, referred to as Δ-restless temporal paths. This constraint arises naturally in the modeling of real-world processes like packet routing in communication networks and infection transmission routes of diseases where recovery confers lasting resistance.
While finding temporal paths without waiting time restrictions is known to be doable in polynomial time, we show that the "restless variant" of this problem becomes computationally hard even in very restrictive settings. For example, it is W[1]-hard when parameterized by the feedback vertex number or the pathwidth of the underlying graph. The main question thus is whether the problem becomes tractable in some natural settings. We explore several natural parameterizations, presenting FPT algorithms for three kinds of parameters: (1) output-related parameters (here, the maximum length of the path), (2) classical parameters applied to the underlying graph (e.g., feedback edge number), and (3) a new parameter called timed feedback vertex number, which captures finer-grained temporal features of the input temporal graph, and which may be of interest beyond this work.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol181-isaac2020/LIPIcs.ISAAC.2020.30/LIPIcs.ISAAC.2020.30.pdf
Temporal graphs
disease spreading
waiting-time policies
restless temporal paths
timed feedback vertex set
NP-hard problems
parameterized algorithms