Pages that link to "Item:Q5415490"
From MaRDI portal
The following pages link to Using petal-decompositions to build a low stretch spanning tree (Q5415490):
Displaying 5 items.
- Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
