Staff Members - Benha University
M. I. Moussa and E. M. Badr (2013): A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREE, International Journal of Soft Computing, Mathematics and Control (IJSCMC) Vol. 2, No.2.
• 2013
Publication Information
Authors
M. I. Moussa and E. M. Badr
Keywords
Not Available
Journal
Not Available
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
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 vertices and edges. This algorithm uses the cluster techniques to reduce the number of processors by fraction and the parallel work by the fraction O ( ), where is an arbitrary function. In the case , the algorithm runs in logarithmic-time and use super linear work on EREWPRAM model. In general, the proposed algorithm is the simplest one.