A divide-and-conquer algorithm for identifying strongly connectedcomponents

Technical Report · Thu Mar 27 04:00:00 EST 2003

DOI:https://doi.org/10.2172/889876· OSTI ID:889876

Coppersmith, Don; Fleischer, Lisa; Hendrickson, Bruce; Pinar, Ali

Strongly connected components of a directed graph can be found in an optimal linear time, by algorithms based on depth first search. Unfortunately, depth first search is difficult to parallelize. We describe two divide--and--conquer algorithms for this problem that have significantly greater potential for parallelization. We show the expected serial runtime of our simpler algorithm to be O(m log n), for a graph with n vertices and m edges. We then show that the second algorithm has O(mlog n) worst--case complexity.

• Research Organization: Ernest Orlando Lawrence Berkeley NationalLaboratory, Berkeley, CA (US)
• Sponsoring Organization: USDOE. Applied Mathematical Sciences Program,Lockheed-Martin Company. Sandia Corporation DE-AC-94AL85000
• DOE Contract Number: AC02-05CH11231
• OSTI ID: 889876
• Report Number(s): LBNL--51867; BnR: YN0100000
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMPUTER CALCULATIONS
DATA ANALYSIS
DIAGRAMS
Design and analysis of algorithms graph algorithms parallelalgorithms strongly connected components divide--and--conquer discreteordinates method