Computing a spanning tree (ST) and a minimum ST (MST) of a graph are fundamental problems in graph theory and arise as a subproblem in many applications. In this article, we propose parallel algorithms to these problems. One of the steps of previous parallel MST algorithms relies on the heavy use of parallel list ranking which, though efficient in theory, is very time-consuming in practice. Using a different approach with a graph decomposition, we devised new parallel algorithms that do not make use of the list ranking procedure. We proved that our algorithms are correct, and for a graph (Formula presented.), (Formula presented.), and (Formula presented.), the algorithms can be executed on a Bulk Synchronous Parallel/Coarse Grained Multicomputer (BSP/CGM) model using (Formula presented.) communications rounds with (Formula presented.) computation time for each round. To show that our algorithms have good performance on real parallel machines, we have implemented them on graphics processing unit. The obtained speedups are competitive and showed that the BSP/CGM model is suitable for designing general purpose parallel algorithms.

Additional Metadata
Keywords BSP/CGM model, GPU, minimum spanning tree, parallel algorithm, Spanning tree
Persistent URL dx.doi.org/10.1177/1094342018803672
Journal International Journal of High Performance Computing Applications
Citation
Vasconcellos, J.F.D.A. (Jucele França de Alencar), Cáceres, E.N. (Edson Norberto), Mongelli, H. (Henrique), Song, S.W. (Siang Wun), Dehne, F, & Szwarcfiter, J.L. (Jayme Luiz). (2018). New BSP/CGM algorithms for spanning trees. International Journal of High Performance Computing Applications. doi:10.1177/1094342018803672