Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 12:1412:14, 15 February 2023‎ Admin talk contribs‎ 466 bytes +466‎ Created page with "== Time Complexity == $O(E log(V)$/p) == Space Complexity == $O(V)$ total words (Initializes and uses a constant number of arrays of size O(V) (and does work similar to work done in Boruvka/Prim algorithm)) == Description == Parallel algorithm == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == PRAM/SMPs? == Year == 2006 == Reference == https://www.sciencedirect.com/science/article/pii/S0743731506001262"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Bader_%26_Cong_Parallel_Implementation_(Undirected,_General_MST_Minimum_Spanning_Tree_(MST))"