Fault tolerant approximate BFS structures with additive stretch
From MaRDI portal
Publication:2211352
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- A nearly optimal algorithm for approximating replacement paths and \(k\) shortest simple paths in general graphs
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graphs
- Constructions of bipartite graphs from finite geometries
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Fault Tolerant Approximate BFS Structures
- Fault tolerant additive spanners
- Fault-tolerant approximate BFS structures
- Fault-tolerant spanners
- Fault-tolerant spanners for general graphs
- Improved purely additive fault-tolerant spanners
- New additive spanners
- On Pairwise Spanners
- Sparse Fault-Tolerant BFS Structures
- \(f\)-sensitivity distance oracles and routing schemes
Cited in
(5)
This page was built for publication: Fault tolerant approximate BFS structures with additive stretch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211352)