Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == unknown but optimal == Space Complexity == $O(E)$ auxiliary? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 2002 == Reference == https://dl.acm.org/doi/10.1145/505241.505243")

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

Jump to navigation Jump to search

Time Complexity

unknown but optimal

Space Complexity

$O(E)$ auxiliary? words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

2002

Reference

https://dl.acm.org/doi/10.1145/505241.505243

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