Improving the efficiency of parallel minimum spanning tree algorithms

Authors:
Ka Wong Chong;Yijie Han;Yoshihide Igarashi;Tak Wah Lam
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong, China;Computer Science Telecommunications Program, University of Missouri 5100 Rockhill Road, 554 STB, Kansas City MO;Department of Computer Science, Gunma University, Kiryu 376-8515, Japan;Department of Computer Science, The University of Hong Kong, Hong Kong, China
Venue:
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Year:
2003

Citing 17
Cited 1

Upper and lower time bounds for parallel random access machines without simultaneous writes

SIAM Journal on Computing
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

IEEE Transactions on Computers
An optimally efficient selection algorithm

Information Processing Letters
Efficient parallel algorithms

Efficient parallel algorithms
Sorting in c log n parallel steps

Combinatorica
Parallel merge sort

SIAM Journal on Computing
A parallel algorithm for computing minimum spanning trees

Journal of Algorithms
Random sampling in graph optimization problems

Random sampling in graph optimization problems
Sorting in linear time?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Finding minimum spanning forests in logarithmic time and linear work using random sampling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On the parallel time complexity of undirected connectivity and minimum spanning trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems

Communications of the ACM
Computing connected components on parallel computers

Communications of the ACM
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Conservative Algorithms for Parallel and Sequential Integer Sorting

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Optimal deterministic approximate parallel prefix sums and their applications

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

On the parallel computation of the biconnected and strongly connected co-components of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents results which improve the efficiency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n)√logn) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m+n)log logn) operations. We also show that for dense graphs we can achieve O(logn) time with O(n2) operations on the EREW PRAM.