Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki
Revision as of 08: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(E*\alpha(E, V))$

Space Complexity

$O(E)$ auxiliary?? words

(Seems like it uses Boruvka phases and contracts the graph, which requires $O(E)$ space, and then additional information in the tree data structure/soft heap don't require space beyond that)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2000

Reference

https://www.cs.princeton.edu/~chazelle/pubs/mst.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chazelle%27s_algorithm_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=46958"