Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST))

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(EV)$ == Space Complexity == $O(E+V)$ words ((derived in sheet)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1965 == Reference == https://nvlpubs.nist.gov/nistpubs/jres/71b/jresv71bn4p233_a1b.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(EV)$

Space Complexity

$O(E+V)$ words

((derived in sheet))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1965

Reference

https://nvlpubs.nist.gov/nistpubs/jres/71b/jresv71bn4p233_a1b.pdf

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