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). © 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fleischer, L. K., Hendrickson, B., & Pinar, A. (2000). On identifying strongly connected components in parallel? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 505–511). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
