Vaidya (Inexact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$O(mn^{({3}/{4})$})
Space Complexity
$O(n)$ words
(Derived: Uses a spanning tree (size $O(n)$))
Description
Using maximum-weight spanning trees
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990