Karger; Klein & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(min(V^{2}, ElogV)$) == Space Complexity == $O(E)$ auxiliary words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == Word RAM == Year == 1995 == Reference == http://cs.brown.edu/research/pubs/pdfs/1995/Karger-1995-RLT.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(E)$ | $O(E)$ words | ||
(can be easily derived) | (can be easily derived) | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(min(V^{2}, ElogV)$)
Space Complexity
$O(E)$ words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
Yes, Las Vegas
Model of Computation
Word RAM
Year
1995
Reference
http://cs.brown.edu/research/pubs/pdfs/1995/Karger-1995-RLT.pdf