On identifying strongly connected components in parallel?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1800 LNCS, Issue , 2000, Pages 505-511

  Fleischer, Lisa K ^a   Hendrickson, Bruce ^b   Pinar, Ali ^c  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

DEPTH FIRST SEARCH; DIVIDE-AND-CONQUER ALGORITHM; PARALLELIZATIONS; RUNNING TIME; SERIAL ALGORITHMS; STRONGLY CONNECTED COMPONENT;

ARTIFICIAL INTELLIGENCE; ALGORITHMS;

EID: 84876397254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45591-4_68     Document Type: Conference Paper

References (15)

1. A. Aggarwal and R. J. Anderson, A random NC algorithm for depth first search, Combinatorica, 8 (1988), pp. 1-12.
2. A. Aggarwal, R. J. Anderson, and M.-Y. Kao, Parallel depth-first search in general directed graphs, SIAM J. Comput., 19 (1990), pp. 397-409.
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.
4. R. S. Baker and K. R. Koch, An Sn algorithm for the massively parallel CM-200 computer, Nuclear Science and Engineering, 128 (1998), pp. 312-320.
5. P. Chaudhuri, Finding and updating depth-first spanning trees of acyclic digraphs in parallel, The Computer Journal, 33 (1990), pp. 247-251.
6. R. Cole and U. Vishkin, Faster optimal prefix sums and list ranking, Information and Computation, 81 (1989), pp. 334-352.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, Cambridge, MA, 1990.
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.
9. H. Gazit and G. L. Miller, An improved parallel algorithm that computes the BFS numbering of a directed graph, Inform. Process. Lett., 28 (1988), pp. 61-65.
10. T. Hagerup, Planar depth-first search in O(log n) parallel time, SIAM J. Comput., 19 (1990), pp. 678-704.
11. M.-Y. Kao, Linear-processor NC algorithms for planar directed graphs I: Strongly connected components, SIAM J. Comput., 22 (1993), pp. 431-459.
12. S. Pautz. Personal Communication, October 1999.
13. S. Plimpton. Personal Communication, May 1999.
14. J. H. Reif, Depth-first search is inherently sequential, Inform. Process. Lett., 20 (1985), pp. 229-234.
15. R. E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.