Dynamic Multi-level Overlay Graphs for Shortest Paths |
| |
Authors: | Francesco Bruera Serafino Cicerone Gianlorenzo D’Angelo Gabriele Di Stefano Daniele Frigioni |
| |
Institution: | (1) Dipartimento di Ingegneria Elettrica e dell’Informazione, Università degli Studi dell’Aquila, Poggio di Roio, I-67040 L’Aquila, Italy |
| |
Abstract: | Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted
directed graph G. They have been shown to be experimentally efficient, especially when applied to timetable information. However, no theoretical
result on the cost of constructing, maintaining and querying multi-level overlay graphs in a dynamic environment is known.
In this paper, we show theoretical properties of multi-level overlay graphs that lead us to the definition of a new data structure
for the computation and the maintenance of an overlay graph of G while weight decrease or weight increase operations are performed on G. Our solution is theoretically faster than the recomputation from scratch and allows queries that can be performed more efficiently
than running Dijkstra’s shortest paths algorithm on G.
This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority – 6th FP), under contract
no. FP6-021235-2 (project ARRIVAL). |
| |
Keywords: | Mathematics Subject Classification (2000)" target="_blank">Mathematics Subject Classification (2000) Primary 68W05 Secondary 05C85 |
本文献已被 SpringerLink 等数据库收录! |