Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

Journal of Algorithms

Volumn 39, Issue 1, 2001, Pages 1-46

  Halperin, Shay ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012637354     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1146     Document Type: Article

References (45)

1. B. Awerbuch, A. Israeli, and Y. Shiloach. Finding Euler circuits in logarithmic parallel time in "Advances in Computing Research" (F. Preparata, Ed.), Vol. 4, pp. 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," pp. 218-223, 1979.
3. B. Awerbuch and Y. Shiloach, New connectivity and MSF algorithms for shuffle-exchange network and PRAM, IEEE Trans. Comput. 36 (1987), 1258-1263.
4. N. Alon and J. H. Spencer, "The Probabilistic Method," Wiley, New York, 1992.
5. M. J. Atallah and U. Vishkin, Finding Euler tours in parallel, J. Comput. Syst. Sci. 29 (1984), 330-337.
6. G. Barnes and U. Feige, Short random walks on graphs, SIAM J. Discrete Mathematics, 9 (1996), 19-28.
7. R. Cole, P. N. Klein, and R. E. Tarjan, Finding minimum spanning forests in logarithmic time and linear work using random sampling, in "Proceedings of the 8th Annual ACM Symposium on Parallel algorithms and architectures, Padua, Italy," 1996.
8. K. W. Chong and T.W. Lam, Finding connected components in O(log n log log n) time on the EREW PRAM, J. Algorithms 18 (1995), 378-402.
9. F. Y. Chin, J. Lam, and I. N. Chen, Efficient parallel algorithms for some graph problems, Commun. ACM 25 (1982), 659-665.
10. R. Cole, Parallel merge-sort, SIAM J. Comput. 17 (1988), 770-785.
11. R. Cole, and U. Vishkin, Approximate parallel scheduling. Part II: Applications to logarithmic-time optimal graph algorithms, Inform. and Comput. 92 (1991), 1-47.
12. D. Fussell, V. Ramachandran, and R. Thurimella, Finding triconnected components by local replacement, SIAM J. Comput. 22 (1993), 587-616.
13. H. Gazit, An optimal randomized parallel algorithm for finding connected components in a graph, SIAM J. Comput. 20 (1991), 1046-1067.
14. H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems, in "Proceedings of the 16th Annual ACM Symposium on Theory of Computing, Washington, DC," pp. 135-143, 1984.
15. M. T. Goodrich and S. R. Kosaraju, Sorting on a parallel pointer machine with applications to set expression evaluation, J. ACM, 43 (1996), 331-361.
16. D. S. Hirschberg, A. K. Chandra, and D.V. Sarwate, Computing connected components on parallel computers, Commun. ACM 22 (1979), 461-464.
17. Y. Han and R. A. Wagner, An efficient and fast parallel connected component algorithm, J. of the ACM, 37 (1990), 626-642.
18. S. Halperin and U. Zwick, Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems, in "Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, Georgia," pp. 438-447, 1996.
19. S. Halperin and U. Zwick, An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM, J. Comput. Syst. Sci. 53 (1996), 395-416.
20. K. Iwama and Y. Kambayashi, A simpler parallel algorithm for graph connectivity, J. Algorithms 16 (1994), 190-217.
21. J. JáJá, "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA, 1992.
22. D. B. Johnson and P. Metaxas, A parallel algorithm for computing minimum spanning trees, J. Algorithms 19 (1995), 383-401.
23. 3/2 n) parallel time for CREW PRAM, J. Comput. Syst. Sci. 54 (1997), 227-242.
24. D. R. Karger, "Random Sampling in Graph Optimization Problems," Ph.D. thesis, Department of Computer Science, Stanford University, 1994.
25. D. R. Karger, P. N. Klein, and R. E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. ACM 42 (1995), 321-328.
26. D. R. Karger, N. Nisan, and M. Parnas, Fast connected components algorithms for the EREW PRAM. SIAM J. Comput. 28 (1999), 1021-1034.
27. V. King, C. K. Poon, V. Ramachandran, and S. Sinha, An optimal EREW PRAM algorithm for minimum spanning tree verification, Inform. Process. Lett. 62 (1997), 153-159.
28. C. P. Kruskal, L. Rudolph, and M. Snir, Efficient parallel algorithms for graph problems, Algorithmica 5 (1990), 43-64.
29. 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," pp. 9-15, 1994.
30. G. Miller and V. Ramachandran, Efficient parallel ear decomposition with applications, unpublished manuscript, MSRI, Berkeley, CA, 1986.
31. G. L. Miller and J. H. Reif, Parallel tree contraction, Part 1: Fundamentals, in "Advances in Computing Research, Vol. 5, Randomness and Computation" (S. Micali, Ed.), pp. 47-72. JAI Press, 1989.
32. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
33. Y. Maon, B. Schieber, and U. Vishkin, Parallel ear decomposition search (eds) and st-numbering in graphs, Theoret. Comput. Sci. 47 (1986), 277-298.
34. D. Nash and S. N. Maheshwari, Parallel algorithms for the connected components and minimal spanning trees, Inform. Process. Lett. 14 (1982), 7-11.
35. 1.5 n) space, in "Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania," pp. 24-29, 1992.
36. C. A. Phillips, Parallel graph contraction, in "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures," pp. 148-157, 1989.
37. C. K. Poon and V. Ramachandran, A randomized linear work EREW PRAM algorithm to find a minimum spanning forest, in "Proceedings of the 8th Annual International Symposium on Algorithms and Computation," 1997.
38. T. Radzik, Computing connected components on EREW PRAM, Technical Report 94/02, King's College London, 1994.
39. V. Ramachandran, Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity, Technical Report UTEXAS.CS//CS-TR-92-02, University of Texas at Austin, Department of Computer Sciences, 1992.
40. V. Ramachandran, Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity, in "Synthesis of Parallel Algorithms" (J. H. Reif, Ed.), Chap. 1, pp. 275-340. Morgan Kaufmann, 1993.
41. V. Ramachandran, personal communication, 1996.
42. V. Ramachandran and J. Reif, Planarity testing in parallel, J. Comput. Syst. Sci. 49 (1994), 517-561.
43. Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms, 3 (1982), 57-67.
44. B. Schieber and U. Vishkin, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput. 17 (1988), 1253-1262.
45. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985), 862-874.