Engineering multi-level overlay graphs for shortest-path queries

DOI10.1137/1.9781611972863.15MaRDI QIDQ5233472zbMATH OpenOpenAlexFDO

Authors Martin Holzer, Frank Schulz, Dorothea Wagner

Publication date 11 September 2019

Published in 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972863.15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Engineering multilevel overlay graphs for shortest-path queries
• Dynamic multi-level overlay graphs for shortest paths
• High-performance multi-level routing
• 15. Maintenance of multi-level overlay graphs for timetable queries
• Shortest-path queries in static networks

Cited in

(3)

• Engineering multilevel overlay graphs for shortest-path queries
• A novel pseudo‐polynomial approach for shortest path problems
• Dynamic multi-level overlay graphs for shortest paths

This page was built for publication: Engineering multi-level overlay graphs for shortest-path queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233472)