A Parallel Graph Algorithm for Finding Connected Components
graph theory; parallel processing; algorithms; connected components
A parallel program is presented that determines the connected components of an undirected graph in time 0(log<sup>2</sup>n) using n<sup>2</sup> processors. It is assumed that the processors have access to common memory. Simultaneous access to the same location is permitted for fetch, but not store, instructions.
MetadataShow full item record
- ECE Publications