A randomized time-work optimal parallel algorithm for finding a minimum spanning forest

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1879-1895

  Pettie, Seth ^a   Ramachandran, Vijaya ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

EREW PRAM; Minimum spanning tree; Optimal algorithm; Parallel algorithm

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PARALLEL ALGORITHMS; PROBABILITY; RANDOM ACCESS STORAGE; RANDOM PROCESSES; THEOREM PROVING;

EXCLUSIVE READ EXCLUSIVE WRITE; MINIMUM SPANNING FOREST; MINIMUM SPANNING TREE; OPTIMAL ALGORITHM; PROGRAMMABLE RANDOM ACCESS STORAGE;

TREES (MATHEMATICS);

EID: 0036767167     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700371065     Document Type: Article

References (23)

1. N. Alon and J. Spencer, The Probabilistic Method, 2nd ed., Wiley-Interscience, New York, 2000.
2. O. Borůvka, O jistém problému minimaálním, Moravské Přírodovědecké Společnosti, 3 (1926), pp. 37-58 (in Czech).
3. K. W. Chong, Y. Han, and T. W. Lam, Concurrent threads and optimal parallel minimum spanning trees algorithm, J. ACM, 48 (2001), pp. 297-323.
4. 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 Symposium on Parallel Algorithms and Architectures (SPAA'94), Cape May, NJ, ACM, pp. 11-15.
5. R. Cole, P. N. Klein, and R. E. Tarjan, Finding minimum spanning trees in logarithmic time and linear work using random sampling, in Proceedings of the 8th Annual Symposium on Parallel Algorithms and Architectures (SPAA'96), Padua, Italy, ACM, pp. 243-250.
6. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math., 1 (1959), pp. 269-271.
7. H. Gazit, An optimal randomized parallel algorithm for finding connected components in a graph, SIAM J. Comput., 20 (1991), pp. 1046-1067.
8. P. B. Gibbons, Y. Matias, and V. Ramachandran, Can a shared-memory model serve as a bridging model for parallel computation?, Theory Comput. Syst., 32 (1999), pp. 327-359.
9. M. T. Goodrich and S. R. Kosaraju, Sorting on a parallel pointer machine with applications to set expression evaluation, J. ACM, 43 (1996), pp. 331-361.
10. S. Halperin and U. Zwick, An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM, J. Comput. System Sci., 53 (1996), pp. 395-416.
11. S. Halperin and U. Zwick, Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems, J. Algorithms, 39 (2001), pp. 1-46.
12. V. Jarník, O jistém problému minimaálním, Moravské Přírodovědecké Společnosti, 6 (1930), pp. 57-63 (in Czech).
13. 3/2 n) parallel time for CREW PRAM, J. Comput. System Sci., 54 (1997), pp. 227-242.
14. V. King, A simpler minimum spanning tree verification algorithm, Algorithmica, 18 (1997), pp. 263-270.
15. D. R. Karger, P. N. Klein, and R. E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. ACM, 42 (1995), pp. 321-328.
16. 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), pp. 153-159.
17. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, Vol. A Elsevier Science, Amsterdam, The Netherlands, 1990, pp. 869-941.
18. C. K. Poon and V. Ramachandran, A randomized linear work EREW PRAM algorithm to find a minimum spanning forest, in Algorithms and Computation (Singapore, 1997), Lecture Notes in Comput. Sci. 1350, Springer-Verlag, Berlin, 1997, pp. 212-222.
19. C. K. Poon and V. Ramachandran, private communication, 1998.
20. S. Pettie and V. Ramachandran, Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, PA, 2002, pp. 713-722.
21. S. Pettie and V. Ramachandran, An optimal minimum spanning tree algorithm, J. ACM, 49 (2002), pp. 16-34.
22. R. C. Prim, Shortest connection networks and some generalizations, Bell System Technical J., 36 (1957), pp. 1389-1401.
23. L. G. Valiant, A bridging model for parallel computation, Comm. ACM, 33 (1990), pp. 103-111.