Abstract
We present a new dynamic graph structure specifically suited for large-scale transportation networks that provides simultaneously three unique features: compactness, agility and dynamicity. We demonstrate its practicality and superiority by conducting an experimental study for shortest route planning in large-scale European and US road networks with a few dozen millions of nodes and edges. Our approach is the first one that concerns the dynamic maintenance of a large-scale graph with ordered elements using a contiguous memory part, and which allows an arbitrary online reordering of its elements. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Mali, G., Michail, P., Paraskevopoulos, A., & Zaroliagis, C. (2013). A new dynamic graph structure for large-scale transportation networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7878 LNCS, pp. 312–323). https://doi.org/10.1007/978-3-642-38233-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
