Spectral sparsification via random spanners

DOI10.1145/2090236.2090267zbMath1347.68364MaRDI QIDQ2826071

Rina Panigrahy, Michael Kapralov

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090267

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

Related Items

Unnamed Item, Density Independent Algorithms for Sparsifying k-Step Random Walks, Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners, A General Framework for Graph Sparsification, Sparsification of Two-Variable Valued Constraint Satisfaction Problems, Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving, A combinatorial cut-toggling algorithm for solving Laplacian linear systems, Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions, Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions, Single Pass Spectral Sparsification in Dynamic Streams

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES