Search-Space Size in Contraction Hierarchies

DOI10.1007/978-3-642-39206-1_9zbMath1336.68190OpenAlexW2097307233MaRDI QIDQ5326553

Reinhard Bauer, Ignaz Rutter, Dorothea Wagner, Tobias Columbus

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs ⋮ Graph Bisection with Pareto Optimization ⋮ Unnamed Item ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Sublinear search spaces for shortest path planning in grid and road networks ⋮ Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs ⋮ Shortest-path queries in static networks ⋮ Customizable Contraction Hierarchies

Uses Software

• Graphs

This page was built for publication: Search-Space Size in Contraction Hierarchies