An Optimisation Approach for Construction of a Distributed Minimum Spanning Tree (DMST) Using MPI
Md. Akkas Ali · International Journal of System and Software Engineering · 2015
The present paper determines Distributed Minimum Spanning Tree (DMST) of very large graphs. It is very time consuming to calculate in a single machine. So the researcher has used parallel programming. One of the DMST algorithms that support parallel computing is Boruvkas algorithm. The researcher has used this algorithm. To avail the parallelism, we have used the MPI architecture.