An Asynchronous Parallel Algorithm for Undirected Graph Connectivity

Richard Cole, O. Zajicek

Research output: Contribution to journalArticle

Abstract

An algorithm for computing the components of an undirected graph in the (asynchronous) APRAM model is given; the algorithm uses O(n + e) processes and O(log n) rounds.

Original languageEnglish (US)
Pages (from-to)50-97
Number of pages48
JournalJournal of Algorithms
Volume18
Issue number1
DOIs
StatePublished - Jan 1995

Fingerprint

Asynchronous Algorithms
Graph Connectivity
Parallel algorithms
Undirected Graph
Parallel Algorithms
Computing
Model

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics

Cite this

An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. / Cole, Richard; Zajicek, O.

In: Journal of Algorithms, Vol. 18, No. 1, 01.1995, p. 50-97.

Research output: Contribution to journalArticle

@article{5833072aaa0a41119c41b8acda7e42ec,
title = "An Asynchronous Parallel Algorithm for Undirected Graph Connectivity",
abstract = "An algorithm for computing the components of an undirected graph in the (asynchronous) APRAM model is given; the algorithm uses O(n + e) processes and O(log n) rounds.",
author = "Richard Cole and O. Zajicek",
year = "1995",
month = "1",
doi = "10.1006/jagm.1995.1002",
language = "English (US)",
volume = "18",
pages = "50--97",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - An Asynchronous Parallel Algorithm for Undirected Graph Connectivity

AU - Cole, Richard

AU - Zajicek, O.

PY - 1995/1

Y1 - 1995/1

N2 - An algorithm for computing the components of an undirected graph in the (asynchronous) APRAM model is given; the algorithm uses O(n + e) processes and O(log n) rounds.

AB - An algorithm for computing the components of an undirected graph in the (asynchronous) APRAM model is given; the algorithm uses O(n + e) processes and O(log n) rounds.

UR - http://www.scopus.com/inward/record.url?scp=58149212017&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58149212017&partnerID=8YFLogxK

U2 - 10.1006/jagm.1995.1002

DO - 10.1006/jagm.1995.1002

M3 - Article

VL - 18

SP - 50

EP - 97

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 1

ER -