Connected Components in O(log3/2n) Parallel Time for the CREW PRAM

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 227-242

  Johnson, Donald B ^a   Metaxas, Panagiotis ^a,b  

^a DARTMOUTH COLLEGE   (United States)

^b WELLESLEY COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; COMPUTER SOFTWARE; EQUIVALENCE CLASSES; GRAPH THEORY; PROBLEM SOLVING; PROGRAM PROCESSORS;

SOFTWARE PACKAGE CREW PRAM; UNDIRECTED GRAPHS;

PARALLEL ALGORITHMS;

EID: 0031118189     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1291     Document Type: Article

References (33)

1. A. Aggarwal, R. J. Anderson, and M.-Y. Kao, Parallel depth-first search in general directed graphs, in "Proceedings, 21st Annual ACM Symposium on the Theory of Computing, May 15-17 1989," pp. 297-308.
2. M. Ajtai, J. Komlós, and E. Szemerédi, Sorting in c log n parallel steps, Combinatorica 3 (1983), 1-19.
3. M. Atallah and U. Vishkin, Finding Euler tours in parallel, J. Comput. System Sci. 29 (1984), 330-337.
4. B. Awerbuch, A. Israeli, and Y. Shiloach, Finding Euler circuits in logarithmic parallel time, in "Proceedings, 16th Annual ACM Symposium on Theory of Computing, 1984," pp. 249-257.
5. B. Awerbuch and Y. Shiloach, New connectivity and MSF algorithms for shuffle-exchange network and PRAM, IEEE Trans. Comput. C-36 (1987), 1258-1263.
6. F. Y. Chin, J. Lam, and I.-N. Chen, Efficient parallel algorithms for some graph problems, Commun. ACM 25, No. 9 (1982), 659-665.
7. K. W. Chong and T. W. Lam, Finding connected components in O(log n log n) time on the EREW PRAM, in "Proceedings, 4th ACM-SIAM Symposium on Discrete Algorithms, January 1993."
8. R. Cole, Parallel merge sort, SIAM J. Comput. 17, No. 4 (1988), 770-785.
9. R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree, and graph problems, in "Proceedings, 27th Annual IEEE Symposium on Foundations of Computer Science, 1986," pp. 478-491.
10. S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15, No. 1 (1986), 87-97.
11. H. Gazit, An optimal randomized parallel algorithm for finding connected components in a graph, SIAM J. Comput. 20 (1991), 1046-1067.
12. A. Goldberg, S. Plotkin, and G. Shannon, Parallel symmetry-breaking in sparse graphs, in "Proceedings, 19th Annual ACM Symposium on Theory of Computing, 1987," pp. 315-324.
13. M. T. Goodrich and S. R. Kosaraju, Sorting on a parallel pointer machine with applications to set expression evaluation, in "Proceedings, 30th IEEE Symposium on Foundations of Computer Science, 1989," pp. 190-195.
14. T. Hagerup, Towards optimal parallel bucket sorting, Inform. and Comput. 75 (1987), 39-51.
15. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, Computing connected components on parallel computers, Commun. ACM 22, No. 8 (1979), 461-464.
16. 3/2 |V|) parallel time for the CREW PRAM (extended abstract), in "Proceedings, 32nd IEEE Symposium on the Foundations of Computer Science, October 1991," pp. 688-697.
17. D. B. Johnson and P. Metaxas, A parallel algorithm for computing minimum spanning trees, in "Proceedings, 4th Annual ACM Symposium on Parallel Algorithms and Architectures, June 1992," 363-372.
18. D. R. Karger, N. Nisan, and M. Parnas, Fast connected components algorithms for the EREW PRAM, in "Proceedings, 4th Symposium on Parallel Algorithms and Architectures, June 1992," 373-381.
19. R. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, Handbook Theoret. Comput. Sci. 1 (1990), 869-941.
20. Y. Maon, B. Schieber, and U. Vishkin, Parallel ear decomposition search (EDS) and s-t numbering in graphs, Theoret. Comput. Sci. 47 (1986), 277-298.
21. P. Metaxas, "Parallel Algorithms for Graph Problems," Ph.D. thesis, Department of Mathematics and Computer Science, Dartmouth College, Hanover, NH, July 1991.
22. G. L. Miller and V. Ramachandran, Efficient parallel ear decomposition with applications, manuscript, 1986; an updated version appears in "Synthesis of Parallel Algorithms" (J. H. Reif, Ed.), Chap. 7, Morgan Kaufman, Los Altos, CA, 1993.
23. D. Nath and S. N. Maheshwari, Parallel algorithms for the connected components and minimal spanning tree problems, Inform. Process. Lett. 14, No. 1 (1982), 7-11.
24. 1.5 n) space, in "Proceedings, 33rd Annual IEEE Symposium on Foundations of Computer Science, October 1992," pp. 24-29.
25. J. Reif, Depth-first search is inherently sequential, Inform. Process. Lett. 20 (1985), 229-234.
26. Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3 (1982), 57-67.
27. R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1, No. 2 (1972).
28. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14, No. 4 (1985), 862-874.
29. U. Vishkin, Implementation of simultaneous memory address access in models that forbid it, J. Algorithms 4 (1983), 45-50.
30. U. Vishkin, On efficient parallel strong orientation, Inform. Process. Lett. 20 (1985), 235-240.
31. U. Vishkin, "Structural Parallel Algorithms," Technical Report UMIACS-TR-91-53, CS-TR-2652, University of Maryland, College Park, MD 20742, April 1991.
32. R. J. Wilson, "Introduction to Graph Theory," 3rd ed., Longman, New York, 1985.
33. J. C. Wyllie, "The Complexity of Parallel Computation," Ph.D. thesis, Computer Science Dept., Cornell University, Ithaca, NY, August 1981.