Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E \log \log V)$

Space Complexity

$O(E)$ auxiliary? words

(keep track of copy of graph where edges may be deleted?)

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_Algorithm_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=46957"