Dynamic Arc-Flags in Road Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Dynamic Arc-Flags in Road Networks

Abstract

In this work we introduce a new data structure, named Road-Signs, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Signs and an algorithm to update them each time that a weight increase operation occurs on an edge of the network. We also experimentally analyze the proposed algorithms in real-world road networks showing that they yields a significant speed-up in the updating phase of Arc-Flags, at the cost of a very small space and time overhead in the preprocessing phase.
Fichier principal
Vignette du fichier
RoadSigns.pdf (353.38 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00644054 , version 1 (23-11-2011)

Identifiers

Cite

Gianlorenzo d'Angelo, Daniele Frigioni, Camillo Vitale. Dynamic Arc-Flags in Road Networks. 10th International Symposium, SEA 2011, May 2011, Kolimpari, Chania, Crete, Greece. pp.88-99, ⟨10.1007/978-3-642-20662-7_8⟩. ⟨hal-00644054⟩
243 View
845 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More