On Identifying Strongly Connected Components in Parallel

Abstract. 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 Onlogn.

• Type: Conference
• Year: 2000
• Where: IPPS
• Authors: Lisa Fleischer, Bruce Hendrickson, Ali Pinar
• Keywords: Depth Rst Search, Distributed And Parallel Computing, IPPS 2000, Standard Serial Algorithm, Strongly Connected Components