Finding strongly connected components in distributed graphs Academic Article uri icon

abstract

  • The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongly connected components in distributed graphs, and discuss how it is used in a radiation transport solver. © 2005 Elsevier Inc. All rights reserved.

author list (cited authors)

  • McLendon, W., Hendrickson, B., Plimpton, S. J., & Rauchwerger, L.

citation count

  • 53

publication date

  • August 2005