Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$O(n \log \log n)$
Space Complexity
()
Description
Support Graph Preconditioning
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2006
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/citation.cfm?id=1117896