A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
1997
Parallel Processing Letters
Preserved Fulltext
Two simple and work-e cient parallel algorithms for the minimum spanning tree problem are presented. Both algorithms perform O(m log n) w ork. The rst algorithm runs in O(log 2 n) time on an EREW PRAM, while the second algorithm runs in O(log n) time on a Common CRCW PRAM.
doi:10.1142/s012962649700005x
fatcat:avrs4fkrrndtfgydrpglshox4i