Preprocess, set, query!
From MaRDI portal
Publication:2017874
Recommendations
Cites work
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- Approximate distance oracles
- Compact Routing in Power-Law Graphs
- Computing almost shortest paths
- Distance Oracles for Sparse Graphs
- Distance Oracles for Stretch Less Than 2
- Distance oracles beyond the Thorup-Zwick bound
- Fast, precise and dynamic distance queries
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- Graph spanners
- Low distortion spanners
- Ramsey partitions and proximity data structures
- Spanners and emulators with sublinear distance errors
Cited in
(11)- Approximate distance oracles with improved stretch for sparse graphs
- Brief announcement: A simple stretch 2 distance oracle
- A linear-size logarithmic stretch path-reporting distance oracle for general graphs
- An I/O-efficient distance oracle for evolving real-world graphs
- A hierarchy of lower bounds for sublinear additive spanners
- Shortest-path queries in static networks
- Approximate distance oracles
- Preprocess, set, query!
- Approximate distance oracles
- Close to linear space routing schemes
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
This page was built for publication: Preprocess, set, query!
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017874)
