Low distortion spanners
From MaRDI portal
Publication:2930280
DOI10.1145/1644015.1644022zbMATH Open1298.05307OpenAlexW2061507472MaRDI QIDQ2930280FDOQ2930280
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1644015.1644022
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cited In (23)
- Graph spanners: a tutorial review
- Distributed construction of purely additive spanners
- On approximating tree spanners that are breadth first search trees
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts
- Improved sourcewise roundtrip spanners with constant stretch
- Thorup-Zwick emulators are universally optimal hopsets
- Deterministic improved round-trip spanners
- Preprocess, set, query!
- Fault tolerant additive and \((\mu, \alpha)\)-spanners
- Source-wise round-trip spanners
- Tree spanners of bounded degree graphs
- A fast algorithm for source-wise round-trip spanners
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
- Rumor Spreading with No Dependence on Conductance
- A note on distance-preserving graph sparsification
- Improved weighted additive spanners
- On additive spanners in weighted graphs with local error
- Almost-optimal sublinear additive spanners
- New pairwise spanners
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners
- Demand-aware network designs of bounded degree
- Title not available (Why is that?)
This page was built for publication: Low distortion spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930280)
