- Full text PDF available (2)
- This year (0)
- Last 5 years (2)
- Last 10 years (2)
—Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim's and Kruskal's algorithm and present their parallelization targeting message passing parallel machine with distributed memory. We consider large graphs that can not fit into memory of one process.… (More)
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(n<sup>2</sup>=p+n log p) and second algorithm runs in O(n<sup>2</sup>=p + n<sup>2</sup> log p).