Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E+VlogV)$

Space Complexity

$O(E+V)$ words

((derived in sheet))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1986

Reference

https://link.springer.com/article/10.1007/BF02579168

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gabow_et_al,_Section_3_(Directed_(Optimum_Branchings),_General_MST_Minimum_Spanning_Tree_(MST))&oldid=45085"