2026-07-19T19:45:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2149 2024-03-06T10:28:39Z ddc:004 open_access

Arc-Flags in Dynamic Graphs Berrettini, Emanuele D'Angelo, Gianlorenzo Delling, Daniel Shortest Path Speed-Up Technique Dynamic Graph Algorithm Shortest Path Speed-Up Technique Dynamic Graph Algorithm Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several basic ingredients. However, not all of those ingredients have been analyzed in a \emph{dynamic} scenario where edge weights change after preprocessing. In this work, we present how one of those ingredients, i.e., Arc-Flags can be applied in dynamic scenarios Schloss Dagstuhl – Leibniz-Zentrum für Informatik Emanuele Berrettini and Gianlorenzo D'Angelo and Daniel Delling 2009 Is Part Of OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2009.2149 urn:nbn:de:0030-drops-21490 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2149 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode