Highly Influenced

# On Identifying Strongly Connected Components in Parallel

@inproceedings{Fleischer2000OnIS, title={On Identifying Strongly Connected Components in Parallel}, author={Lisa Fleischer and Bruce Hendrickson and Ali Pinar}, booktitle={IPDPS Workshops}, year={2000} }

- Published 2000 in IPDPS Workshops
DOI:10.1007/3-540-45591-4_68

The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm for this problem which has signi cantly 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).Â

Highly Cited

This paper has 87 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

59 Citations

16 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 88 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**88**citations based on the available data.See our **FAQ** for additional information.