A new infinity of distance oracles for sparse graphs
From MaRDI portal
Cited in
(5)- Towards optimal set-disjointness and set-intersection data structures
- On the space usage of approximate distance oracles with sub-2 stretch
- New tradeoffs for decremental approximate all-pairs shortest paths
- New approximate distance oracles and their applications
- New tradeoffs for decremental approximate all-pairs shortest paths
This page was built for publication: A new infinity of distance oracles for sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988169)