Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree

Algorithmica (New York)

Volumn 16, Issue 6, 1996, Pages 633-648

  Johnson, D B ^a   Metaxas, P ^b  

^a DARTMOUTH COLLEGE   (United States)

^b WELLESLEY COLLEGE   (United States)

Author keywords

EREW PRAM model; Minimum spanning tree; Optimal parallel and sequential algorithms; Vertex updating

Indexed keywords

EID: 0242344389     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01944354     Document Type: Article

References (25)

1. R. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201 -206, 1974.
2. R. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. Handbook for Theoretical Computer Science, 1:869-941, 1990.
3. P. M. Spira and A. Pan. On finding and updating spanning trees and shortest paths. SIAM Journal on Computing, 4(3):375-380, September 1975.
4. F. Chin and D. Houck. Algorithms for updating minimal spanning trees. Journal of Computer and System Sciences, 16(12):333-344, 1978.
5. S. Pawagi and I. V. Ramakrishnan. An O(log n) algorithm for parallel update of minimum spanning trees. Information Processing Letters, 22(5):223-229, April 1986.
6. P. Varman and K. Doshi. A parallel vertex insertion algorithm for minimum spanning trees. Proceedings of 13th ICALP, pages 424-433. Lecture Notes in Computer Science, volume 226. Springer-Verlag, Berlin, 1986.
7. H. Jung and K. Mehlhorn. Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. Information Processing Letters, 27(5):227-236, April 1988.
8. D. B. Johnson and P. Metaxas. A parallel algorithm for computing minimum spanning trees. Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '92), pages 363-372, June 1992.
9. K. W. Chong and T. W. Lam. Finding connected components in O (log n log log n) time on the EREW PRAM. Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 11-20, January 1993.
10. D. B. Johnson and P. Metaxas. Optimal algorithms for the vertex updating problem of a minimum spanning tree. Proceedings of the 6th International Parallel Proccessing Symposium (IPPS '92), pages 306-314, March 1992.
11. F. Y. Chin, J. Lam, and I-N. Chen. Efficient parallel algorithms for some graph problems. Communications of ACM, 25(9):659-665, September 1982.
12. R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3:329-346, 1988.
13. G. L. Miller and J. H. Reif. Parallel tree contraction. Part 1: Fundamentals. Advances in Computing Research, 5:47-72, 1989.
14. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10:287-302, 1989.
15. S. Rao Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. Proceedings of the Aegean Workshop on Computing, pages 101-110, 1988.
16. A. Gibbons and W. Rytter. An optimal parallel algorithm for dynamic expression evaluation and its applications. Proceedings of the Symposium on Foundations of Software Technology and Theoretical Computer Science, volume 6, pages 453-469. Springer-Verlag, New York, 1986.
17. H. Gazit, G. L. Miller, and S. H. Teng. Optimal tree contraction in the EREW model. In Concurrent Computations: Algorithms, Architecture, and Technology, S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz (editors). Plenum, New York, pages 139-170, 1988.
18. R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM Journal of Computing, 14(4):862-874, 1985.
19. S. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal of Computing, 15(1):87-97, February 1986.
20. R. Cole and U. Vishkin. Approximate parallel scheduling. Part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal of Computing, 17(1):128-142, February 1988.
21. R. J. Anderson and G. L. Miller. Deterministic parallel list ranking. Algorithmica, 6:859-868, 1991.
22. S. Pawagi. A parallel algorithm for multiple updates of minimum spanning trees. Proceedings of the International Conference on Parallel Processing, volume III, pages 9-15, 1989.
23. S. Pawagi and O. Kaser. Optimal parallel algorithms for multiple updates of minimum spanning trees. Technical Report, Department of Computer Science, SUNY at Stony Brook, 1991. Unpublished Manuscript.
24. A. Schäffer and P. Varman. Parallel batch update of minimum spanning trees. Technical report, Department of Electrical and Computer Engineering, Rice University, May 1991. Unpublished Manuscript.
25. R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.