On Identifying Strongly Connected Components in Parallel
The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divide-and-conquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we show the expected serial running time of our algorithm to be O(n log n).
KeywordsDirected Graph Planar Graph Radiation Transport Discrete Ordinate Topological Sort
Unable to display preview. Download preview PDF.
- 3.D. A. Bader, A practical parallel algorithm for cycle detection in partitioned digraphs, Tech. Rep. Technical Report AHPCC-TR-99-013, Electrical & Computer Eng. Dept., Univ. New Mexico, Albuquerque, NM, 1999.Google Scholar
- 4.R. S. Baker and K. R. Koch, An Snalgorithm for the massively parallel CM-200 computer, Nuclear Science and Engineering, 128 (1998), pp. 312–320.Google Scholar
- 7.T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, Cambridge, MA, 1990.Google Scholar
- 8.M. R. Dorr and C. H. Still, Concurrent source iteration in the solution of 3-dimensional, multigroup discrete ordinates neutron-transport equations, Nuclear Science and Engineering, 122 (1996), pp. 287–308.Google Scholar
- 12.S. Pautz. Personal Communication, October 1999.Google Scholar
- 13.S. Plimpton. Personal Communication, May 1999.Google Scholar