Cheriton-Tarjan (dense) (Undirected, Dense 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 == $O(E)$ == Space Complexity == $O(E)$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://epubs.siam.org/doi/abs/10.1137/0205051")

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

Jump to navigation Jump to search

Time Complexity

$O(E)$

Space Complexity

$O(E)$ auxiliary? words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://epubs.siam.org/doi/abs/10.1137/0205051

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Cheriton-Tarjan_(dense)_(Undirected,_Dense_MST_Minimum_Spanning_Tree_(MST))&oldid=45076"