A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an EREW PRAM. This result is optimal with respect to both work and parallel time, and is the rst provably optimal parallel algorithm for this problem under both measures. 0 

• Type: Conference
• Year: 1999
• Where: RANDOM
• Authors: Seth Pettie, Vijaya Ramachandran
• Keywords: Minimum Spanning Forest, Optimal Parallel Algorithm, RANDOM 1999, Randomized Algorithm, Theoretical Computer Science