Abstract
We present a randomized EREW PRAM algorithm to find a minimum spanning forest in a weighted undirected graph. On an nvertex graph the algorithm runs in o((logn)1+∈) expected time for any ∈ > 0 and performs linear expected work. This is the first 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.
Cite
CITATION STYLE
Poon, C. K., & Ramachandran, V. (1997). A randomized linear work EREW pram algorithm to find a minimum spanning forest. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1350, pp. 212–222). Springer Verlag. https://doi.org/10.1007/3-540-63890-3_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
