Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$\tilde{O}(m \log n)$
Space Complexity
$O(n)$ words
(Derived: Uses an auxiliary chain of graphs, which can be kept track of with a single spanning tree)
Description
Incremental sparsifier
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2011