Thorup (reverse-delete) (Undirected, General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E \log V (\log \log V)^{3})$

Space Complexity

$O(E)$ auxiliary? words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2000

Reference

https://www.cs.princeton.edu/courses/archive/spr10/cos423/handouts/NearOpt.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Thorup_(reverse-delete)_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))&oldid=46960"