Hierarchical Hub Labelings for Shortest Paths

DOI10.1007/978-3-642-33090-2_4zbMath1365.05270OpenAlexW2146583842MaRDI QIDQ2912823

Ittai Abraham, Daniel Delling, Renato F. Werneck, Andrew V. Goldberg

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_4

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Eccentricity queries and beyond using hub labels ⋮ On the Complexity of Hub Labeling (Extended Abstract) ⋮ Customizable hub labeling: properties and algorithms ⋮ Fully Dynamic 2-Hop Cover Labeling ⋮ The compressed differential heuristic ⋮ Shortest-path queries in static networks ⋮ Distance Queries in Large-Scale Fully Dynamic Complex Networks ⋮ Candidate Sets for Alternative Routes in Road Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies ⋮ Dynamically Maintaining Shortest Path Trees under Batches of Updates ⋮ ReHub ⋮ Customizable Contraction Hierarchies ⋮ The hierarchical hub labeling is non-efficient

This page was built for publication: Hierarchical Hub Labelings for Shortest Paths