A parallel algorithm for the minimum spanning tree on an SIMD machine

Authors:
Francis Suraweera;Prabir Bhattacharya
Affiliations:
School of Computing & Information Technology, Griffith University, Nathan, Qld. 4111, Australia;Department of Computer Science & Engineering, University of Nebraska-Lincoln, Lincoln, NE
Venue:
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Year:
1992

Citing 11
Cited 0

Parallel graph algorithms

ACM Computing Surveys (CSUR)
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computer algorithms: introduction to design and analysis (2nd ed.)

Computer algorithms: introduction to design and analysis (2nd ed.)
Efficient parallel algorithms

Efficient parallel algorithms
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Analysis of a modified address calculation sorting algorithm

The Computer Journal
A fast algorithm for the minimum spanning tree

Computers in Industry
A parallel algorithm for eliminating cycles in undirected graphs

Information Processing Letters
Graph Problems on a Mesh-Connected Processor Array

Journal of the ACM (JACM)
Data Structures and Algorithms

Data Structures and Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel algorithm for constructing a minimum spanning tree of a connected, weighted, undirected graph in O(log m) time using O(m + ) processors is presented for an SIMD machine where m and n denote the number of edges and vertices respectively.