Tarjan (directed, dense) (Directed (Optimum Branchings), Super Dense MST Minimum Spanning Tree (MST))

From Algorithm Wiki
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(E)$ words (https://onlinelibrary.wiley.com/doi/10.1002/net.3230070103) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://onlinelibrary.wiley.com/doi/10.1002/net.3230070103")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{2})$

Space Complexity

$O(E)$ words

(https://onlinelibrary.wiley.com/doi/10.1002/net.3230070103)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://onlinelibrary.wiley.com/doi/10.1002/net.3230070103

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tarjan_(directed,_dense)_(Directed_(Optimum_Branchings),_Super_Dense_MST_Minimum_Spanning_Tree_(MST))&oldid=45084"