Parallel algorithms for the connected components and minimal spanning tree problems

Two current problems in the area of graph theory are the problem of finding a minimal spanning tree (MST) in a connected, weighted, undirected graph and the problem of finding the connected components of an undirected graph. Algorithms have been obtained to solve both problems. However, the run time...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 1982-03, Vol.14 (1), p.7-11
Main Authors: Nath, Dhruva, Maheshwari, S.N.
Format: Article
Language:English
Subjects:
Algorithms
computational complexity
connected components
graph theory
Information processing
Mathematics
minimal spanning tree
Parallel algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two current problems in the area of graph theory are the problem of finding a minimal spanning tree (MST) in a connected, weighted, undirected graph and the problem of finding the connected components of an undirected graph. Algorithms have been obtained to solve both problems. However, the run time is significantly greater if these algorithms are implemented in a network where read conflicts are not allowed to occur. A new approach is reported which permits the algorithm to run without read conflicts in little more than the time previously required for running in a network where read conflicts were permitted to occur. The new techniques also can be run using a smaller number of processors.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(82)90131-4