The following pages link to Lower-stretch spanning trees (Q3581444):
Displayed 17 items.
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane (Q3223968) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)