Revision as of 04:43, 15 April 2004 edit Captain Segfault (talk \| contribs) 57 edits add "randomized" and "expected" to KKT algorithm ← Previous edit		Revision as of 21:56, 1 June 2004 edit undo Jaredwf (talk \| contribs) 1,674 edits Category:Algorithms Next edit →
Line 4: Other algorithms for this problem include [[Prim's algorithm]] and [[Kruskal's algorithm]]. Faster algorithms can be obtained by combining Prim's algorithm with Borůvka's. A faster randomized algorithm due to Karger, Klein and Tarjan runs in expected O(m) time, where m is the number of edges in the graph. [[Category:Algorithms]]

Borůvka's algorithm: Difference between revisions