Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$O(m \log^c n)$
Space Complexity
$O(n)$ words
(Derived: Uses spanning trees and sparse Cholesky factorization which both take $O(n)$ space)
Description
Spectral Sparsification
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2004