Finding strongly connected components in parallel in particle transport sweeps

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 328-329

  McLendon III, W ^a   Hendrickson, B ^a   Plimpton, S ^a   Rauchwerger, L ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS;

DISTRIBUTED MEMORY MACHINES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034824325     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378751     Document Type: Conference Paper

References (7)

1. On identifying strongly connected components in parallel
2. Identifying strongly connected components in parallel
3. Parallel algorithms for shared-memory machines
4. Depth-first search is inherently sequential
5. Depth-first search and linear graph algorithms