Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST))
Jump to navigation
Jump to search
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