Karger; Klein & Tarjan (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Karger;_Klein_%26_Tarjan_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=46922"