When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2009.2149
URN: urn:nbn:de:0030-drops-21490
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2149/
 Go to the corresponding OASIcs Volume Portal

### Arc-Flags in Dynamic Graphs

 pdf-format:

### 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 \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

### BibTeX - Entry

@InProceedings{berrettini_et_al:OASIcs:2009:2149,
author =	{Emanuele Berrettini and Gianlorenzo D'Angelo and Daniel Delling},
title =	{{Arc-Flags in Dynamic Graphs}},
booktitle =	{9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)},
series =	{OpenAccess Series in Informatics (OASIcs)},
ISBN =	{978-3-939897-11-8},
ISSN =	{2190-6807},
year =	{2009},
volume =	{12},
editor =	{Jens Clausen and Gabriele Di Stefano},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},