An optimal EREW PRAM algorithm for minimum spanning tree verification

Information Processing Letters

Volumn 62, Issue 3, 1997, Pages 153-159

  King, Valerie ^b   Poon, Chung Keung ^a   Ramachandran, Vijaya ^a   Sinha, Santanu ^a  

^a University of Texas at Austin   (United States)

^b NONE

Author keywords

Design of algorithms; EREW PRAM; Minimum spanning tree verification; Optimal algorithm; Parallel algorithms

Indexed keywords

EID: 0012682946     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00050-1     Document Type: Article

References (20)

1. N. Alon and B. Schieber, Optimal preprocessing for answering online product queries, Tech. Rept., Tel Aviv University, 1987.
2. O. Borůvka, O jistéem problému minimálním, Práca Moravské Přírodovědecké Společnosti 3 (1926) 37-58 (in Czech).
3. S.A. Cook, C. Dwork and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15 (1) (1986) 87-97.
4. R. Cole, P.N. Klein and R.E. Tarjan, Finding minimum spanning trees in logarithmic time and linear work using random sampling, in: Proc. 1996 ACM Symp. on Parallel Algorithms and Architectures (1996) 243-249.
5. K.W. Chong and T.W. Lam, Connected components in O(log n log log n) time on the EREW PRAM, in: Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms (1993) 11-20.
6. B. Dixon, M. Rauch and R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM J. Comput. 21 (6) (1992) 1184-1192.
7. B. Dixon and R.E. Tarjan, Optimal parallel verification of minimum spanning trees in logarithmic time, in Parallel and Distributed Computing, Theory and Practice, Lecture Notes in Computer Science, Vol. 805 (Springer, Berlin, 1994) 13-22.
8. P.B. Gibbons, Y. Matias and V. Ramachandran, The QRQW PRAM: Accounting for contention in parallel algorithms, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (1994) 638-648.
9. S. Halperin and U. Zwick, Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems, in: Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (1996) 438-447.
10. J. JáJá, An Introduction to Parallel Algorithms (Addison Wesley, Reading, MA, 1992).
11. D.R. Karger, Random sampling in graph optimization problems, Ph.D. Thesis, Dept. of Computer Science, Stanford University, 1995.
12. S.R. Kosaraju and A. Delcher, Optimal parallel evaluation of tree-structured computations raking, in: Proc. Aegean Workshop on Computing (1988) 101-110.
13. V. King, A simpler minimum spanning tree verification algorithm, in: Lecture Notes in Computer Science, Vol. 955 (Springer, Berlin, 1995) 440-448.
14. J. Kómlos, Linear verification for spanning trees, Combinatorica 5 (1985) 57-65.
15. R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity (Elsevier Science, Amsterdam and MIT Press, Cambridge, MA, 1990) 869-941.
16. G.L. Miller, V. Ramachandran and E. Kaltofen, Efficient parallel evaluation of straight-line code and arithmetic circuits, SIAM J. Comput. 17 (4) (1988) 687-695.
17. C. K. Poon, V. Ramachandran and S. Sinha, A randomized linear work EREW PRAM algorithm to find a minimum spanning tree, Unpublished manuscript, University of Texas at Austin, 1996.
18. V. Ramachandran, Private communication to U. Zwick, January 1996; to be included in journal version of: S. Halperin and U Zwick, Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems, in: Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (1996) 438-447.
19. R.E. Tarjan, Applications of path compressions on balanced trees, J. ACM 26 (4) (1979) 690-715.
20. R.E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (4) (1985) 862-874.