Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 438-447

  Halperin, Shay ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

BASIC GRAPHS; BICONNECTED COMPONENTS; BIPARTITE PARTITION; CONNECTIVITY PROBLEMS; EAR DECOMPOSITION; PRAM ALGORITHMS; STRONG ORIENTATION; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 84969332424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. B. Awerbuch, A. Israeli, and Y. Shiloach. Finding euler circuits in logarithmic parallel time. In F. Preparata, editor, Advances in Computing Research, Volume 4, pages 79-86. JAI Press, 1987.
2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal sequences and the complexity of maze problems. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pages 218-223, 1979.
3. B. Awerbuch and Y. Shiloach. New connectivity and MSP algorithms for shuffle-exchange network and PRAM. IEEE Transactions on Computers, C-36:1258-1263, 1987.
4. M.J. Atallah and U. Vishkin. Finding euler tours in parallel. Journal of Computer and System Sciences, 29:330-337, 1984.
5. G. Barnes and U. Feige. Short random walks on graphs. In Proceedings of the 25rd Annual ACM Symposium on Theory of Computing, San Diego, California, pages 728-737, 1993.
6. R. Cole, P.N. Klein, and R.E. Tarjan. A linear-work parallel algorithm for finding minimum spanning trees. In Proceedings of the 6th Annual ACM Symposium on Parallel algorithms and architectures, Cape May, New Jersey, pages 11-15, 1994.
7. K.W. Chong and T.W. Lam. Finding connected components in O(log n log log n) time on the EREW PRAM. Journal of Algorithms, 18:378-402, 1995.
8. F.Y. Chin, J. Lam, and I.N. Chen. Efficient parallel algorithms for some graph problems. Communications of the ACM, 25(9):659-665, 1982.
9. R. Cole. Parallel merge-sort. SIAM Journal on Computing, 17(4):770-785, 1988.
10. R. Cole and U. Vishkin. Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms. Information and Computation, 92:1-47, 1991.
11. D. Fussell, V. Ramachandran, and R. Thurimella. Finding triconnected components by local replacement. SIAM Journal on Computing, 22:587-616, 1993.
12. H. Gazit. An optimal randomized parallel algorithm for finding connected components in a graph. SIAM Journal on Computing, 20(6):1046-1067, 1991.
13. M.T. Goodrich and S.R. Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, pages 190-195, 1989.
14. D.S. Hirschberg, A.K. Chandra, and D.V. Sarwate. Computing connected components on parallel computers. Communications of the ACM, 22(8):461-464, 1979.
15. Y. Han and R.A. Wagner. An efficient and fast parallel connected component algorithm. Journal of the ACM, 37(3):626-642, 1990.
16. S. Halperin and U. Zwick. An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM. In Proceedings of the 6th Annual ACM Symposium on Parallel algorithms and architectures, Cape May, New Jersey, pages 1-10, 1994. Journal version submitted for publication.
17. K. Iwama and Y. Kambayashi. A simpler parallel algorithm for graph connectivity. Journal of Algorithms, 16:190-217, 1994.
18. 3/2 |V|) parallel time for the CREW PRAM. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pages 688-697, 1991.
19. D.B. Johnson and P. Metaxas. A parallel algorithm for computing minimum spanning trees. In Proceedings of the 4th Annual ACM Symposium on Parallel algorithms and architectures, San Diego, California, pages 363-372, 1992.
20. D.R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In Proceedings of the 4th Annuol. ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, pages 21-30, 1993.
21. D.R. Karger. Random Sampling in Graph Optimization Problems. PhD thesis, Department of Computer Science, Stanford University, 1994.
22. D.R. Karger, P.N. Klein, and R.E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42:321-328, 1995.
23. D.R. Karger, N. Nisan, and M. Parnas. Fast connected components algorithms for the EREW PRAM. In Proceedings of the 4th Annual ACM Symposium on Parallel algorithms and architectures, San Diego, California, pages 373-381, 1992.
24. C.P. Kruskal, L. Rudolph, and M. Snir. Efficient parallel algorithms for graph problems. Algorithmica, 5:43-64, 1990.
25. P.N. Klein and R.E. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montréal, Canada, pages 9-15, 1994.
26. Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search (eds) and si-numbering in graphs. Theoretical Computer Science, 47:277-298, 1986.
27. D. Nash and S.N. Maheshwari. Parallel algorithms for the connected components and minimal spanning trees. Information Processing Letters, 14:7-11, 1982.
28. 1.5 n) space. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, pages 24-29, 1992.
29. C.A. Phillips. Parallel graph contraction. In Proceedings of the 1st Annual ACM Symposium on Parallel algorithms and architectures, pages 148-157, 1989.
30. T. Radzik. Computing connected componnets on EREW PRAM. Technical Report 94/02, King's College London, 1994.
31. V. Ramachandran. Parallel open ear decomposition with applications to graph biconnectivity and tri-connectivity. In J.H. Reif, editor, Synthesis of Parallel Algorithms, chapter 1, pages 275-340. Morgan Kaufmann, 1993.
32. V. Ramachandran and J. Reif. Planarity testing in parallel. Journal of Computer and System Sciences, 49:517-561, 1994.
33. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. Journal of Algorithms, 3(1):57-67, 1982.
34. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing, 17:1253-1262, 1988.
35. R.E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal on Computing, 14:862-874, 1985.