Parallel implementation of minimum spanning tree algorithms using MPI
Vladimir Lončar, Srdjan Škrbić · 2012
In this paper we study parallel algorithms for finding minimum spanning tree of a graph. We present two algorithms, based on sequential algorithms of Prim and Kruskal, targeting message passing parallel machine with distributed memory. First algorithm runs in O(n2=p+n log p) and second algorithm runs in O(n2=p + n2log p).