Pages that link to "Item:Q3188987"
From MaRDI portal
The following pages link to Additive spanners and (α, β)-spanners (Q3188987):
Displayed 33 items.
- On resilient graph spanners (Q289925) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← 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)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- A note on distance-preserving graph sparsification (Q2059887) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← 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)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← 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)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← 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)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)
- Communication-efficient distributed graph clustering and sparsification under duplication models (Q6057354) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)