Thumbnail
Access Restriction
Subscribed

Author Sarwate, D. V. ♦ Chandra, A. K. ♦ Hirschberg, D. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Transitive closure ♦ Algorithms ♦ Connected component ♦ Parallel processing ♦ Graph theory
Abstract We present a parallel algorithm which uses n2 processors to find the connected components of an undirected graph with n vertices in time O(log2n). An O(log2n) time bound also can be achieved using only n⌈n/⌈log2n⌉⌉ processors. The algorithm can be used to find the transitive closure of a symmetric Boolean matrix. We assume that the processors have access to a common memory. Simultaneous access to the same location is permitted for fetch instructions but not for store instructions.
Description Affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, NY (Chandra, A. K.) || Univ. of Illinois, Urbana (Sarwate, D. V.) || Rice Univ., Houston, TX (Hirschberg, D. S.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 8
Page Count 4
Starting Page 461
Ending Page 464


Open content in new tab

   Open content in new tab
Source: ACM Digital Library