Sparse Distance Preservers and Additive Spanners
From MaRDI portal
Recommendations
Cited in
(22)- New pairwise spanners
- Relaxed spanners for directed disk graphs
- Graph spanners: a tutorial review
- Sparse Sourcewise and Pairwise Distance Preservers
- Small stretch pairwise spanners and approximate D-preservers
- scientific article; zbMATH DE number 2079365 (Why is no real title available?)
- A hierarchy of lower bounds for sublinear additive spanners
- Better distance preservers and additive spanners
- Near-optimal distance emulator for planar graphs
- Better Distance Preservers and Additive Spanners
- Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
- Distance-preserving subgraphs of interval graphs
- Bypassing Erdős' girth conjecture: hybrid stretch and sourcewise spanners
- Steiner shallow-light trees are exponentially lighter than spanning ones
- New results on linear size distance preservers
- A story of diameter, radius, and (almost) Helly property
- Improved weighted additive spanners
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms
- New fault tolerant subset preservers
- Additive spanner lower bounds with optimal inner graph structure
- Additive sparsification of CSPs
- Isometric-universal graphs for trees
This page was built for publication: Sparse Distance Preservers and Additive Spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470808)