Dynamic arc-flags in road networks

Authors:
Gianlorenzo D'Angelo;Daniele Frigioni;Camillo Vitale
Affiliations:
Department of Electrical and Information Engineering, University of L'Aquila, L'Aquila, Italy;Department of Electrical and Information Engineering, University of L'Aquila, L'Aquila, Italy;Department of Electrical and Information Engineering, University of L'Aquila, L'Aquila, Italy
Venue:
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Year:
2011

Citing 9
Cited 1

Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
Using Multi-level Graphs for Timetable Information in Railway Systems

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric containers for efficient shortest-path computation

Journal of Experimental Algorithmics (JEA)
Partitioning graphs to speedup Dijkstra's algorithm

Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Landmark-based routing in dynamic graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Dynamic highway-node routing

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Fully dynamic maintenance of arc-flags in road networks

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 speedup in the updating phase of Arc-Flags, at the cost of a very small space and time overhead in the preprocessing phase.