eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-06-12
4:1
4:11
10.4230/LIPIcs.SAND.2023.4
article
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time
Brunelli, Filippo
1
Viennot, Laurent
1
Université Paris Cité, Inria, CNRS, IRIF, Paris, France
This paper proposes a simple algorithm for computing single-source reachability in a temporal graph under waiting-time constraints, that is when waiting at each node is bounded by some time constraints. Given a space-time representation of a temporal graph, and a source node, the algorithm computes in linear-time which nodes and temporal edges are reachable through a constrained temporal walk from the source.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol257-sand2023/LIPIcs.SAND.2023.4/LIPIcs.SAND.2023.4.pdf
temporal reachability
temporal graph
temporal path
temporal walk
waiting-time constraints
restless temporal walk
linear time