Preprocess, set, query!
From MaRDI portal
Publication:2017874
DOI10.1007/S00453-013-9825-9zbMATH Open1307.68094OpenAlexW2178691795MaRDI QIDQ2017874FDOQ2017874
Authors: Ely Porat, Liam Roditty 
Publication date: 23 March 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9825-9
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05) Distance in graphs (05C12)
Cites Work
- Approximate distance oracles
- Computing almost shortest paths
- Low distortion spanners
- Graph spanners
- Ramsey partitions and proximity data structures
- Distance Oracles for Sparse Graphs
- Distance oracles beyond the Thorup-Zwick bound
- Distance Oracles for Stretch Less Than 2
- Compact Routing in Power-Law Graphs
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- Spanners and emulators with sublinear distance errors
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- Fast, precise and dynamic distance queries
Cited In (11)
- Approximate distance oracles
- Close to linear space routing schemes
- Approximate distance oracles with improved stretch for sparse graphs
- A hierarchy of lower bounds for sublinear additive spanners
- An I/O-efficient distance oracle for evolving real-world graphs
- Shortest-path queries in static networks
- Preprocess, set, query!
- A linear-size logarithmic stretch path-reporting distance oracle for general graphs
- Approximate distance oracles
- Brief announcement: A simple stretch 2 distance oracle
- 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)
