Highly Influential

@inproceedings{Moussa2013ANP, title={A New Parallel Algorithm for Computing Minimum Spanning Tree}, author={M. Ibrahim Moussa}, year={2013} }

- Published 2013

Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected weighted graph with n vertices and m edges. This algorithm uses the cluster techniques to reduce the number of processors by fraction 1/ ( ) f n and the… CONTINUE READING

### Presentations referencing similar topics