An optimal randomized parallel algorithm for finding connected components in a graph

We present a parallel randomized algorithm for finding the connected components of an undirected graph. Our algorithm takes T = O(log (n)) time and p = O(m+n/(log(n) processors, where m = number of edges and n = number of vertices. This algorithm improves the results of Cole and Vishkin1, which use...

Full description

Saved in:
Bibliographic Details
Published in:27th Annual Symposium on Foundations of Computer Science (sfcs 1986) pp. 492 - 501
Main Author: Gazit, Hillel
Format: Conference Proceeding
Language:English
Published: IEEE 01.10.1986
Subjects:
Computational modeling
Computer science
Concurrent computing
Parallel algorithms
Phase change random access memory
Polynomials
Random number generation
Read-write memory
Testing
ISBN:0818607408, 9780818607400
ISSN:0272-5428
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a parallel randomized algorithm for finding the connected components of an undirected graph. Our algorithm takes T = O(log (n)) time and p = O(m+n/(log(n) processors, where m = number of edges and n = number of vertices. This algorithm improves the results of Cole and Vishkin1, which use O(log (n)·log (log (n))· log (log (log (n))) time. Our algorithm is Optimal in the sense that the product P·T is a linear function of the input size. The algorithm requires O(m + n) space which is the input size, so it is Optimal in space as well.
ISBN:0818607408
9780818607400
ISSN:0272-5428
DOI:10.1109/SFCS.1986.9