The following pages link to Low distortion spanners (Q2930280):
Displayed 21 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- New pairwise spanners (Q1693988) (← links)
- Preprocess, set, query! (Q2017874) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- A note on distance-preserving graph sparsification (Q2059887) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
- Deterministic improved round-trip spanners (Q2410583) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- (Q5116490) (← links)
- Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts (Q5157382) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Improved weighted additive spanners (Q6096039) (← links)