Robust Distance Queries on Massive Networks

DOI10.1007/978-3-662-44777-2_27zbMath1423.68332OpenAlexW154362522MaRDI QIDQ2921417

Renato F. Werneck, Daniel Delling, Andrew V. Goldberg, Thomas Pajor

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_27

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

On the Complexity of Hub Labeling (Extended Abstract) ⋮ Customizable hub labeling: properties and algorithms ⋮ Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind ⋮ Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs ⋮ Fully Dynamic 2-Hop Cover Labeling ⋮ Sublinear search spaces for shortest path planning in grid and road networks ⋮ Unnamed Item ⋮ Distance Queries in Large-Scale Fully Dynamic Complex Networks ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ ReHub ⋮ Customizable Contraction Hierarchies

Uses Software

• Graphs

This page was built for publication: Robust Distance Queries on Massive Networks