A randomized linear work EREW pram algorithm to find a minimum spanning forest

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

Volumn 1350, Issue , 1997, Pages 212-222

  Poon, Chung Keung ^a   Ramachandran, Vijaya ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXPECTED TIME; LINEAR WORKS; MINIMUM SPANNING FORESTS; N-VERTEX GRAPH; PARALLEL COMPUTATION; REALISTIC MODEL; TIME ALGORITHMS; WEIGHTED UNDIRECTED GRAPH;

ALGORITHMS;

EID: 84904466612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_24     Document Type: Conference Paper

References (18)

1. O. Boruvka. O jistem problemu minimalnim. Prirodovedecke Spolecnosti, 3:37-58, 1926. In Czech. Praca Moravske
2. K. W. Chong. Finding minimum spanning trees on the EREW PRAM. In Proceedings of the 1996 International Conference on Algorithms, pages 7-14, Taiwan, 1996.
3. R. Cole, P.N. Klein, and R.E. Tarjan. A linear-work parallel algorithm for finding minimum spanning trees. In Proceedings of the 1994 ACM Symposium on Parallel Algorithms and Architectures, pages 11-15, 1994.
4. 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 1996 ACM Symposium on Parallel Algorithms and Architectures, pages 213-219, 1996.
5. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, 1991.
6. F. Dehne and S. Gotz. Efficient parallel minimum spanning algorithms for coarse grained multicomputers and BSP, June 1997. Manuscript, Carleton University, Ottawa, Canada.
7. W. Dittrich, B. Juurlink, and I. Rieping, June 1997. Private communication by Ingo Rieping.
8. P.B. Gibbons, Y. Matias, and V. Ramachandran. The QRQW PRAM: Accounting for contention in parallel algorithms. In Proceedings of the Filth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 638-648, 1994.
9. P. B. Gibbons, Y. Matias, and V. Ramachandran. Can a shared-memory model serve as a bridging model for parallel computation? In Proceedings of the 1997 ACM Symposium on Parallel Algorithms and Architectures, pages 72-83, 1997.
10. 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 Seventh ACM-SIAM Symposium on Discrete Algorithms, pages 438-447, 1996.
11. D. R. Karger. Random sampling in matroids, with applications to graph connectivity and minimum spanning trees. In 34th Annual Symposium on Foundations of Computer Science, pages 84-93, 1993.
12. D. R. Karger. Random Sampling in Graph Optimization Problems. PhD thesis, Department of Computer Science, Stanford University, 1995.
13. 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.
14. V. King, C. K. Poon, V. Ramachandran, and S. Sinha. An optimal EREW PRAM algorithm for minimum spanning tree verification. Inlormation Processing Letters, 62(3):153-159, 1997.
15. V. Ramachandran. Private communication to Uri Zwick, January, 1996. To be included in journal version of [HZ96].
16. V. Ramachandran. A general purpose shared-memory model for parallel computation. Technical Report TR97-16, Univ. of Texas at Austin, 1997.
17. R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.
18. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.