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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1671, Issue , 1999, Pages 233-244

  Pettie, Seth ^a   Ramachandran, Vijaya ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; PARALLEL ALGORITHMS; RANDOM PROCESSES;

EREW PRAM; LINEAR WORKS; LOGARITHMIC TIME; MINIMUM SPANNING FORESTS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84958757975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_24     Document Type: Conference Paper

References (18)

1. B. Awerbuch, Y. Shiloach. New connectivity and MSF algorithms for shuffle- exchange networks and PRAM. IEEE Trans. Computers, vol. C-36, 1987, pp. 1258-1263.
2. O. Boruvka. O jistem problemu minimaalnim. Moravske Prirodovedecke Spolecnosti 3, 1926), pp. 37-58. (In Czech).
3. K. W. Chong, Y. Han, T. W. Lam. On the parallel time complexity of undirected connectivity and minimum spanning trees. In Proc. SODA 1999, pp. 225-234.
4. R. Cole, P.N. Klein, R.E. Tarjan. A lineai-work parallel algorithm for finding minimum spanning trees. In Proc. SPAA, 1994, pp. 11-15.
5. R. Cole, P.N. Klein, R.E. Tarjan. Finding minimum spanning trees in log­arithmic time and linear work using random sampling. In Proc. SPAA, 1996, pp. 213-219.
6. H. Gazit An optimal randomized parallel algorithm for finding connected components in a graph. SICOMP, vol. 20, 1991, pp. 1046-1067.
7. P.B. Gibbons, Y. Matias, V. Ramachandran. The QRQW PRAM: Account­ing for contention in parallel algorithms. In Proc. SODA, 1994, pp. 638-648 (SICOMP 1999, to appear.)
8. P. B. Gibbons, Y. Matias, V. Ramachandran. Can a shared-memory model serve as a bridging model for parallel computation? In Proc. SPAA, 1997, pp. 72-83. (Theory of Comp. Sys., 1999, to appear.)
9. S. Halperin, U. Zwick. An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM. In Proc. SPAA, 1994, pp. 1-10.
10. S. Halperin, U. Zwick. Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems. In Proc. SODA, 1996, pp. 438-447, 1996.
11. D. B. Johnson, P. Metaxas. Connected components in 0(log3/2 n) parallel time for CREW PRAM. JCSS, vol. 54, 1997, pp. 227-242.
12. V. King. A simpler minimum spanning tree verification algorithm. Algorith- mica, vol. 18, 1997, pp. 263-270.
13. D. R. Karger, P. N. Klein, R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. JACM, 42:321-328, 1995.
14. V. King, C. K. Poon, V. Ramachandran, S. Sinha. An optimal EREW PRAM algorithm for minimum spanning tree verification. IPL, 62(3):153-159, 1997.
15. C. K. Poon, V. Ramachandran. A randomized linear work EREW PRAM algorithm to find a minimum spanning forest. Proc ISAAC, 1997, pp. 212-222.
16. C. K. Poon, V. Ramachandran. Private communication, 1998.
17. S. Pettie, V. Ramachandran. A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest Tech. Report TR99-13, Univ. of Texas at Austin, 1999.
18. L. G. Valiant. A bridging model for parallel computation. CACM, 33(8):103-111, 1990