Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391): Difference between revisions

@@ Property / cites work @@
+Advances in metric embedding theory
@@ Property / cites work: Advances in metric embedding theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934632
@@ Property / cites work: Q2934632 / rank @@
+Normal rank
@@ Property / cites work @@
+Ramsey Spanning Trees and Their Applications
@@ Property / cites work: Ramsey Spanning Trees and Their Applications / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem
+Normal rank
@@ Property / cites work @@
+Q4542533
@@ Property / cites work: Q4542533 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934633
@@ Property / cites work: Q2934633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542528
@@ Property / cites work: Q4542528 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
+Normal rank
@@ Property / cites work @@
+Solving SDD linear systems in nearly             <i>m</i>             log             <sup>1/2</sup>             <i>n</i>             time
+Normal rank
@@ Property / cites work @@
+Lower-stretch spanning trees
@@ Property / cites work: Lower-stretch spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5351905
@@ Property / cites work: Q5351905 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501267
@@ Property / cites work: Q5501267 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight upper bound on the probabilistic embedding of series-parallel graphs
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsified Cholesky and multigrid solvers for connection laplacians
+Normal rank
@@ Property / cites work @@
+A Nearly-m log n Time Solver for SDD Linear Systems
+Normal rank
@@ Property / cites work @@
+A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
+Normal rank
@@ Property / cites work @@
+A faster algorithm for the single source shortest path problem with few distinct positive lengths
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
+Normal rank