Arc-Flags in Dynamic Graphs

Abstract. 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 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.

• Type: Conference
• Year: 2009
• Where: ATMOS
• Authors: Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel Delling
• Keywords: ATMOS 2009, Dynamic Scenarios, Optimization, Quickest Paths, Route Planning Algorithms