A New Parallel Algorithm for Minimum Spanning Tree(MST)

Provided by: Creative Commons
Topic: Data Management
Format: PDF
In this paper, the authors propose a new algorithm for finding Minimum Spanning Tree (MST) of a weighted graph which is intrinsically parallel, unlike Kruskal's algorithm. As far as the running time of the algorithm is concerned, it is faster than both Kruskal's and Boruvka's algorithms. However, the Prim's algorithm is bit faster than the proposed algorithm. The parallel implementation of the proposed algorithm in shared memory is also better than Boruvka's parallel algorithm, but comparable with Prim's parallel algorithm.

Find By Topic