Finding strongly connected components in distributed graphs

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

Full description

Saved in:
Bibliographic Details
Published inJournal of parallel and distributed computing Vol. 65; no. 8; pp. 901 - 910
Main Authors McLendon III, William, Hendrickson, Bruce, Plimpton, Steven J., Rauchwerger, Lawrence
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 01.08.2005
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Graph algorithm
Parallel computing
Software
Strongly connected components
Theoretical computing
Parallel computing
Graph algorithm
Strongly connected components
First depth search
Parallel algorithm
Connected graph
Parallel computation
Distributed computing
Directed graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2005.03.007