DMCA
On Identifying Strongly Connected Components in Parallel (2000)
Cached
Download Links
- [www.cse.uiuc.edu]
- [ftp.cs.sandia.gov]
- [pdf.aminer.org]
- [ipdps.cc.gatech.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 33 - 4 self |
BibTeX
@MISC{Fleischer00onidentifying,
author = {Lisa K. Fleischer and Bruce Hendrickson and Ali Pinar},
title = {On Identifying Strongly Connected Components in Parallel},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divide-and-conquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we show the expected serial running time of our algorithm to be O(n log n). 1 Introduction A strongly connected component of a directed graph is a maximal subset of vertices containing a directed path from each vertex to all others in the subset. The vertices of any directed graph can be partitioned into a set of disjoint strongly connected components. This decomposition is a fundamental tool in graph theory with applications in compiler analysis, data mining, scientific computing and other areas. The definitive serial algorithm for identifying strongly connected components is due to Tarjan [15] and is built on a depth first search of the graph. For a grap...
