A divide-and-conquer algorithm for identifying strongly connectedcomponents
Don Coppersmith, Lisa Fleischer, Bruce Hendrickson, Ali Pınar · 2003
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.