Pages that link to "Item:Q3587400"
From MaRDI portal
The following pages link to Additive Spanners in Nearly Quadratic Time (Q3587400):
Displaying 20 items.
- New pairwise spanners (Q1693988) (← 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)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← 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)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4575773) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Sparse Weight Tolerant Subgraph for Single Source Shortest Path (Q5116479) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)
- (Q6083385) (← links)
- Improved weighted additive spanners (Q6096039) (← links)
- Improved sourcewise roundtrip spanners with constant stretch (Q6591481) (← links)