Vaidya (Inexact Laplacian Solver SDD Systems Solvers)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Vaidya_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)&oldid=45266"