An asynchronous parallel algorithm for undirected graph connectivity

Richard Cole, Ofer 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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'An asynchronous parallel algorithm for undirected graph connectivity'. Together they form a unique fingerprint.

  • Cite this