A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time for any > 0 and performs linear expected work. This is the rst linear work, polylog time algorithm on the EREW PRAM for this problem. This also gives parallel algorithms that perform expected linear work on two more realistic models of parallel computation, the QSM and the BSP.

• Type: Conference
• Year: 1997
• Where: ISAAC
• Authors: Chung Keung Poon, Vijaya Ramachandran
• Keywords: Algorithms, EREW PRAM Algorithm, ISAAC 1997, Linear Expected Work, Linear Work