Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))
Jump to navigation
Jump to search
Time Complexity
$O(E*beta(E, V)$) where beta(m, n) = min(i such that log^(i)(n)≤m/n); this is also $O(E (log-star)$V)
Space Complexity
$O(E)$ auxiliary? words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1987