Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VlogV+Eloglog(logV/log(E/V + {2})$)) == Space Complexity == $O(E)$ words ((derived in sheet)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://ieeexplore.ieee.org/abstract/document/715935")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(VlogV+Eloglog(logV/log(E/V + {2})$))

Space Complexity

$O(E)$ words

((derived in sheet))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1984

Reference

https://ieeexplore.ieee.org/abstract/document/715935

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gabow,_Galil,_Spencer_(Directed_(Optimum_Branchings),_General_MST_Minimum_Spanning_Tree_(MST))&oldid=45083"