Finding strongly connected components in parallel using O(log2 n) reachability queries

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 146-151

  Schudy, Warren ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Graph algorithms; Parallel algorithms; Strongly connected components; Topological sort; Transitive closure bottleneck

Indexed keywords

GRAPH ALGORITHMS; REACH ABILITIES; REACHABILITY QUERIES; SPARSE GRAPHS; STRONGLY CONNECTED COMPONENTS; TOPOLOGICAL SORT; TOPOLOGICAL SORTS; TRANSITIVE CLOSURE BOTTLENECK;

ALGORITHMS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; TOPOLOGY;

PARALLEL ALGORITHMS;

EID: 57349195102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378560     Document Type: Conference Paper

References (22)

1. A. Aggarwal, R. J. Anderson, and M.-Y. Kao. Parallel depth-first search in general directed graphs. SIAM J. Comput, 19(2):397-409, 1990.
2. D. Bader. A practical parallel algorithm for cycle detection in partitioned digraphs. Technical Report AHPCC-TR-99-013, Electrical & Computer Eng. Dept., Univ. New Mexico, Albuquerque, NM, 1999.
3. R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. Form. Methods Syst. Des., 28(l):37-56, 2006.
4. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Set., 55(3):441-453, 1997.
5. D. Coppersmith, L. Fleischer, B. Hendrickson, and A. Pinar. A divide-and-conquer algorithm for identifying strongly connected components. Technical Report RC23744, IBM Research, 2005.
6. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In STOC '87: Proceedings of the nineteenth annual ACM Symposium on Theory of Computing, pages 1-6, New York, NY, USA, 1987. ACM Press.
7. L. Fleischer, B. Hendrickson, and A. Pinar. On identifying strongly connected components in parallel. In IPDPS '00: Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing, pages 505-511, London, UK, 2000. Springer-Verlag.
8. H. Gazit and G. L. Miller. An improved parallel algorithm that computes the bfs numbering of a directed graph. Inf. Process. Lett, 28(2):61-65, 1988.
9. R. Gentilini, C. Piazza, and A. Policriti. Computing strongly connected components in a linear number of symbolic steps. In SODA '03: Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics.
10. J. Greiner. A comparison of parallel algorithms for connected components. In SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, pages 16-25, New York, NY, USA, 1994. ACM Press.
11. M.-Y. Kao. Linear-processor nc algorithms for planar directed graphs i: Strongly connected components. SIAM J. Comput, 22:431-459, 1993.
12. M.-Y. Kao and P. N. Klein. Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs. In STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 181-192, New York, NY, USA, 1990. ACM Press.
13. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. Handbook of theoretical computer science (vol. A): algorithms and complexity, pages 869-941, 1990.
14. W. McLendon, III, B. Hendrickson, S. Plimpton, and L. Rauchwerger. Finding strongly connected components in parallel in particle transport sweeps. In ACM Symposium on Parallel Algorithms and Architectures, pages 328-329, 2001.
15. W. McLendon, III, B. Hendrickson, S. J. Plimpton, and L. Rauchwerger. Finding strongly connected components in distributed graphs. J. Parallel Distrib. Comput, 65(8):901-910, 2005.
16. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis, chapter 4.2, page 66. Cambridge University Press, 2005.
17. S. Plimpton, B. Hendrickson, S. Burns, and W. McLendon, III. Parallel algorithms for radiation transport on unstructured grids. In Supercomputing '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDR.OM), page 25, Washington, DC, USA, 2000. IEEE Computer Society.
18. S. Rajasekaran and J. H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput, 18(3):594-607, 1989.
19. J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229-234, 1985.
20. T. H. Spencer. Time-work tradeoffs for parallel algorithms. J. ACM, 44(5):742-778, 1997.
21. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
22. J. D. Ullman and M. Yannakakis. High probability parallel transitive-closure algorithms. SIAM J. Comput., 20(1):100-125, 1991.