Gabow, Galil, Spencer (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(VlogV+Eloglog(logV/log(E/V + {2})$))

Space Complexity

$O(E)$ words

((derived in sheet))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1984

Reference

https://ieeexplore.ieee.org/abstract/document/715935