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}
}
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
59 Citations
16 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 59 extracted citations

88 Citations

01020'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 88 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Personal Communication, May

  • S. Plimpton
  • 1999
1 Excerpt

Personal Communication, October

  • S. Pautz
  • 1999
1 Excerpt

An Sn algorithm for the massively parallel CM-200 computer

  • R. S. Baker, K. R. Koch
  • Nuclear Science and Engineering,
  • 1998
1 Excerpt

Concurrent source iteration in the solution of 3-dimensional, multigroup discrete ordinates neutron-transport equations

  • M. R. Dorr, C. H. Still
  • Nuclear Science and Engineering,
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…