Fast and Compact Oracles for Approximate Distances in Planar Graphs

DOI10.1007/978-3-540-75520-3_58zbMath1151.68566OpenAlexW1591854528MaRDI QIDQ3527255

Laurent Flindt Muller, Martin Zachariasen

Publication date: 25 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_58

Mathematics Subject Classification ID

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

Related Items (3)

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Shortest-path queries in static networks ⋮ Engineering Route Planning Algorithms

This page was built for publication: Fast and Compact Oracles for Approximate Distances in Planar Graphs