Distance Oracles for Sparse Graphs
From MaRDI portal
Publication:5171228
DOI10.1109/FOCS.2009.27zbMath1292.05253MaRDI QIDQ5171228
Christian Sommer, Elad Verbin, Wei Yu
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (14)
Distance oracles for time-dependent networks ⋮ A Hierarchy of Lower Bounds for Sublinear Additive Spanners ⋮ Efficient Oracles and Routing Schemes for Replacement Paths ⋮ An introduction to the Ribe program ⋮ Ultrametric subsets with large Hausdorff dimension ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Distance Oracles for Vertex-Labeled Graphs ⋮ Shortest-path queries in static networks ⋮ Preprocess, set, query! ⋮ Close to linear space routing schemes ⋮ On Approximate Distance Labels and Routing Schemes with Affine Stretch ⋮ Approximate distance oracles with improved stretch for sparse graphs ⋮ Unnamed Item ⋮ An axiomatic approach to time-dependent shortest path oracles
This page was built for publication: Distance Oracles for Sparse Graphs
