Yao's 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

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1975

Reference

https://www.sciencedirect.com/science/article/pii/0020019075900563