Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(V)$

Space Complexity

$O(V)$ 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_(planar)_(Undirected,_Planar_MST_Minimum_Spanning_Tree_(MST))&oldid=45078"