Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E*log(beta(E, V)$))

Space Complexity

$O(E)$ auxiliary? words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1986

Reference

https://link.springer.com/article/10.1007/BF02579168

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gabow_et_al,_Section_2_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=45077"