High-performance multi-level routing

MaRDI QIDQ3574263zbMATH OpenFDO

Authors Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner

Publication date 9 July 2010

zbMATH Keywords

decompositiongraph compressionhierarchylevelspreprocessingshortest pathsspeed-up techniquesupersedement

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Engineering Highway Hierarchies
• Engineering highway hierarchies
• Algorithms – ESA 2005
• Partitioning graphs to speedup Dijkstra's algorithm
• Experimental and Efficient Algorithms

Cited in

(9)

• Energy-optimal routes for battery electric vehicles
• User-constrained multimodal route planning
• Levelwise mesh sparsification for shortest path queries
• Boosting the exploration of huge dynamic graphs
• scientific article; zbMATH DE number 1926659 (Why is no real title available?)
• Engineering multi-level overlay graphs for shortest-path queries
• Engineering multilevel overlay graphs for shortest-path queries
• Experimental and Efficient Algorithms
• Fission: Practical algorithms for computing minimum balanced node separators

This page was built for publication: High-performance multi-level routing

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