Improving the efficiency of parallel minimum spanning tree algorithms Original Research Article

This paper presents results which improve the efficiency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n)log n) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m+n) log log n) operations. We also show that for dense graphs we can achieve O(log n) time with O(n2) operations on the EREW PRAM.