Title: Finding Strongly Connected Components in Distributed Graphs <BR>
Author: William C. McLendon III, Bruce Hendrickson, Steve Plimpton and
	Lawrence Rauchwerger<BR>
Status: In Journal of Parallel &amp Distributed Computing 65(8):901-910, 2005<P>

Abstract: <P>

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.
<P>


<A HREF="http://www.sandia.gov/~bahendr/papers/scc_code.pdf"> 
Download full paper</A>.