Date of Award
Master of Science
Dr. Ajay Gupta
Dr. Fred Boals
Dr. Naveed A. Sherwani
Masters Thesis-Open Access
In this thesis, we have considered three graph problems namely, spanning forest problem, connected component problem and minimum cost spanning forest problem. Standard methods to solve these problems using sequential algorithms by various authors are presented for each problem. Efficient parallel algorithms for these problems have also been presented by various authors; however, most of these solutions demands a need for large number of processors, which immediately increases the cost of the hardware and in most of the cases it seems not very practical.
We present efficient solutions for the three problems on a hypercube parallel computer using p processors. We implemented our algorithm on the nCUBE-2 parallel computer and experimentally computed the speedup for each algorithm. Our experimental results are very encouraging in general and we observe superior results when compared to the best known algorithms.
Anand-Kumar, "Pargal: A Package for Parallel Graph Algorithms" (1992). Master's Theses. 901.