The following pages link to On Pairwise Spanners (Q2957885):
Displaying 26 items.
- Spanning with indexes (Q406270) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- New pairwise spanners (Q1693988) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← 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)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Sparse source-wise and pair-wise distance preservers (Q2921725) (← links)
- New Pairwise Spanners (Q2955020) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- Error Amplification for Pairwise Spanner Lower Bounds (Q4575639) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
- New (<i>α, β</i>) Spanners and Hopsets (Q5146883) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Algorithms and Computation (Q5712142) (← links)
- New Results on Linear Size Distance Preservers (Q5858650) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
