Finding strongly connected components in distributed graphs

Journal of Parallel and Distributed Computing

Volumn 65, Issue 8, 2005, Pages 901-910

  McLendon III, William ^a   Hendrickson, Bruce ^a   Plimpton, Steven J ^a   Rauchwerger, Lawrence ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Graph algorithm; Parallel computing; Strongly connected components

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SET THEORY;

GRAPH ALGORITHM; RADIATION TRANSPORT SOLVERS; STRONLY CONNECTED COMPONENTS; TOPOLOGICAL TRAVERSALS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 20444476140     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.03.007     Document Type: Article

References (17)

1. N. Amato Improved processor bounds for parallel algorithms for weighted directed graphs Inform. Process. Lett. 45 3 1993 147 152
2. D. Bader, A practical parallel algorithm for cycle detection in partitioned digraphs, Technical Report AHPCC-TR-99-013, University of New Mexico, Albuquerque, NM, 1999.
3. A.H. Baker, S. Crivelli, E.R. Jessup, An efficient parallel termination detection algorithm, Technical Report CU-CS-915-01, University of Colorado, 2001.
4. R. Brightwell, L.A. Fisk, D.S. Greenberg, T. Hudson, M. Levenhagen, A.B. Maccabe, and R. Riesen Massively parallel computing using commodity components Parallel Comput. 26 February 2000
5. R. Cole, and U. Vishkin Faster optimal parallel prefix sums and list ranking Inform. Comput. 81 1989 334 352
6. L. Fleischer, B.A. Hendrickson, A. Pinar, On identifying strongly connected components in parallel in solving irregularly structured problems in parallel, Lecture Notes in Computer Science, vol. 1800, Springer, Berlin, 2000, pp. 505-512.
7. H. Gazit, and G.L. Miller An improved parallel algorithm that computes the BFS numbering of a directed graph Inform. Process. Lett. 28 2 1988 61 65
8. B. Hendrickson, R. Leland, The Chaco user's guide, version 2.0, Technical Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, October, 1994.
9. M.Y. Kao, G.E. Shannon, Linear-processor NC algorithms for planar directed graphs II: directed spanning trees, Technical Report DUKE-TR-1990-02, Duke University, Durham, NC, 1990.
10. R.M. Karp, and V. Ramachandran Parallel algorithms for shared-memory machines J. Leeuwen Handbook of Theoretical Computer Science, Algorithms and Complexity 1990 Elsevier Science Publishers B.V. 869 941
11. T.G. Mattson, G. Henry, The Asci Option Red Supercomputer, May 1996.
12. n sweeps on unstructured meshes Nuclear Sci. Engrg. 140 2 February 2002 111 136
13. S.J. Plimpton, B.A. Hendrickson, S.P. Burns, W.C. McLendon III, Parallel algorithms for radiation transport on unstructured grids, in: Proceedings of SuperComputing 2000 (SC2000), November 2000, Dallas, TX.
14. S.J. Plimpton, B. Hendrickson, S.P. Burns, W. McLendon III, L. Rauchwerger, Parallel Sn sweeps on unstructured grids: algorithms for prioritization, grid partitioning, and cycle detection, Nuclear Sci. Engrg. 150 (2005) 1-17.
15. M.J. Quinn, and N. Deo Parallel graph algorithms ACM Comput. Surveys (CSUR) 16 3 1984 319 348
16. J.H. Reif Depth-first search is inherently sequential Inform. Process. Lett. 20 5 1985 229 234
17. R.E. Tarjan Depth first search and linear graph algorithms SIAM J. Comput. 1 2 June 1972 146 160