Twice-Ramanujan Sparsifiers
From MaRDI portal
Publication:4910582
DOI10.1137/090772873zbMath1260.05092MaRDI QIDQ4910582
Nikhil Srivastava, Joshua Batson, Daniel A. Spielman
Publication date: 19 March 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090772873
barrier method; spectral graph theory; spectral sparsification; sparse quadratic forms; rank-one updates; graph sparsification; paving conjecture
68R10: Graph theory (including graph drawing) in computer science
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15B48: Positive matrices and their generalizations; cones of matrices
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
