2026-07-23T05:43:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17940 2024-03-06T11:00:29Z ddc:004 open_access

Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time Brunelli, Filippo Viennot, Laurent temporal reachability temporal graph temporal path temporal walk waiting-time constraints restless temporal walk linear time 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Filippo Brunelli and Laurent Viennot 2023 Is Part Of LIPIcs, Volume 257, 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAND.2023.4 urn:nbn:de:0030-drops-179402 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.4 eng https://creativecommons.org/licenses/by/4.0/legalcode