The following pages link to (Q4449190):
Displaying 19 items.
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Network flow spanners (Q3057178) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- Light Spanners (Q5499739) (← links)
