Fault tolerant approximate BFS structures with additive stretch
From MaRDI portal
Publication:2211352
DOI10.1007/S00453-020-00734-2zbMATH Open1494.68027OpenAlexW3045695800MaRDI QIDQ2211352FDOQ2211352
Authors: M. Parter, David Peleg 
Publication date: 11 November 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00734-2
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Title not available (Why is that?)
- Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graphs
- \(f\)-sensitivity distance oracles and routing schemes
- Fault-tolerant spanners
- Additive spanners and \(({\alpha}, {\beta})\)-spanners
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Fault tolerant additive spanners
- New additive spanners
- Constructions of bipartite graphs from finite geometries
- On Pairwise Spanners
- Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time
- Improved purely additive fault-tolerant spanners
- A nearly optimal algorithm for approximating replacement paths and \(k\) shortest simple paths in general graphs
- Fault-tolerant spanners for general graphs
- Fault Tolerant Approximate BFS Structures
- Fault-tolerant approximate BFS structures
- Sparse Fault-Tolerant BFS Structures
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)
