Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(Elog(V))$ == Space Complexity == $O(E)$ auxiliary? words (Kruskal-based, with minimal overhead? filtering should only remove edges, and each edge should only require O(1) information) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2009 == Reference == https://dl.acm.org/citation.cfm?id=2791225") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(E \log V)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:54, 10 April 2023
Time Complexity
$O(E \log V)$
Space Complexity
$O(E)$ auxiliary? words
(Kruskal-based, with minimal overhead? filtering should only remove edges, and each edge should only require O(1) information)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2009