Finding Minimum Spanning Trees on the EREW PRAM

Abstract

This paper presents a parallel algorithm for finding the minimum spanning tree of a weithted undirected graph in O(log n log log n) time using n + m processors on the EREW PRAM. The best previous known results for this problem run in O(log 1.5n ) time using a linear number of EREW processors, or O[log n log log n] time using (n +m)m∈processors, where ∈>0 is a constant.