A divide-and-conquer algorithm for identifying strongly connectedcomponents

Technical Report · Thu Mar 27 00: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: Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
• Sponsoring Organization: USDOE. Applied Mathematical Sciences Program,Lockheed-Martin Company. Sandia Corporation DE-AC-94AL85000
• DOE Contract Number: DE-AC02-05CH11231
• OSTI ID: 889876
• Report Number(s): LBNL-51867; R&D Project: 365968; BnR: YN0100000; TRN: US200620%%2
• Country of Publication: United States
• Language: English

Related Subjects

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