Approximate distance oracles with improved stretch for sparse graphs
From MaRDI portal
Cites work
- Approximate distance oracles
- Approximate distance oracles with improved query time
- Approximate distance oracles with improved stretch for sparse graphs
- Close to linear space routing schemes
- Compact Routing in Power-Law Graphs
- Compact routing schemes with improved stretch
- Distance oracles beyond the Thorup-Zwick bound
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time
- New routing techniques and their applications
- On approximate distance labels and routing schemes with affine stretch
- The Power of Dynamic Distance Oracles
Cited in
(6)- Approximating the distance to properties in bounded-degree and general sparse graphs
- A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
- scientific article; zbMATH DE number 6784973 (Why is no real title available?)
- Distance Oracles for Stretch Less Than 2
- Approximate distance oracles with improved stretch for sparse graphs
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
This page was built for publication: Approximate distance oracles with improved stretch for sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5972260)
