Pages that link to "Item:Q2826071"

The following pages link to Spectral sparsification via random spanners (Q2826071):

Displaying 10 items.

• Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
• Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
• (Q5090437) (← links)
• Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
• A General Framework for Graph Sparsification (Q5232324) (← links)
• Sparsification of Two-Variable Valued Constraint Satisfaction Problems (Q5270406) (← links)
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
• A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
• Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
• Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)