Abstract
Parallel updates of minimum spanning trees (MSTs) have been studied in the past. These updates allowed a single change in the underlying graph, such as a change in the cost of an edge or an insertion of a new vertex. Multiple update problems for MSTs are concerned with handling more than one such change. In the sequential case multiple update problems may be solved using repeated applications of an efficient algorithm for a single update. However, for efficiency reasons, parallel algorithms for multiple update problems must consider all changes to the underlying graph simultaneously. In this paper we describe parallel algorithms for updating an MST whenk new vertices are inserted or deleted in the underlying graph, when the costs ofk edges are changed, or whenk edge insertions and deletions are performed. For multiple vertex insertion update, our algorithm achieves time and processor bounds ofO(log n·logk) and nk/(logn·logk), respectively, on a CREW parallel random access machine. These bounds are optimal for dense graphs. A novel feature of this algorithm is a transformation of the previous MST andk new vertices to a bipartite graph which enables us to obtain the above-mentioned bounds.
Similar content being viewed by others
References
F. Chin and D. Houck, Algorithms for Updating Minimum Spanning Trees,J. Comput. System Sci.,16 (1978), 333–344.
F. Chin, J. Lam, and I. Chen, Efficient Parallel Algorithms for Some Graph Problems,Comm. ACM,25(1982), 170–175.
R. Cole and U. Vishkin, The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time,Algorithmica,3 (1988), 329–346.
R. Cole and U. Vishkin, Approximate Parallel Scheduling, Part I.SIAM J. Comput.,17 (1988), 128–142.
G. Frederickson, Data Structure for On-line Updating of Minimum Spanning Trees,SIAM J. Comput.,14 (1985), 781–798.
H. Gazit, G. L. Miller, and S. H. Teng, Optimal Tree Contraction in the EREW Model, Extended abstract, 1986.
H. Jung and K. Mehlhorn, Parallel Algorithms for Computing Maximum Independent Set in Trees and for Updating Minimum Spanning Trees, Technical Report 01, University of Saarlandes, Saarbrucken, 1987.
O. Kaser and S. Pawagi, Dynamic Tree Contraction and Its Application to Optimal Parallel Updates of Minimum Spanning Trees, Technical Report 25, Department of Computer Science, State University of New York, Stony Brook, 1990.
J. B. Kruskal, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,Proc. Amer. Math. Soc,7 (1956), 48–50.
C. P. Kruskal, L. Rudolph, and M. Snir, Efficient Parallel Algorithms for Graph Problems,Algorithmica,5 (1990), 43–64.
G. L. Miller and J. H. Reif, Parallel Tree Contraction and Its Applications,Proc. Twenty-Fifth Annual Symposium on Foundations of Computer Science, 1985, pp. 478–489.
S. Pawagi, A Parallel Algorithm for Multiple Updates of Minimum Spanning Trees,Proc. Eighteenth International Conference of Parallel Processing, 1989, pp. III.9–15.
S. Pawagi and I. V. Ramakrishnan, Parallel Update of Graph Properties in Logarithmic Time,Proc. Fourteenth International Conference on Parallel Processing, 1985, pp. 186–193.
S. Pawagi and I. V. Ramarkrishnan, An0(logn) Algorithm for Parallel Update of Minimum Spanning Trees,Inform. Process. Lett.,22 (1986), 223–229.
R. Prim, Shortest Interconnection Networks and Some Generalizations,Bell System Tech. J.,36 (1957), 1389–1401.
S. Rajasekaran and J. H. Reif, Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms,SIAM J. Comput.,18 (1989), 594–607.
C. Savage and J. Ja'Ja', Fast Efficient Parallel Algorithms for Some Graph Problems,SIAM J. Comput.,10 (1981), 682–691.
Y. Shiloach and U. Vishkin, AnO(logn) Parallel Connectivity Algorithm,J. Algorithms,3 (1982), 57–67.
P. Spira and A. Pan, On Finding and Updating Spanning Trees and Shortest Paths,SIAM J. Comput.,4 (1975), 375–380.
R. E. Tarjan and U. Vishkin, Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time,SIAM J. Conput.,14 (1985), 862–874.
Y. H. Tsin, On Handling Vertex Deletion in Updating Minimum Spanning Trees,Inform. Process. Lett.,27 (1988), 167–168.
Y. H. Tsin, Private communication, 1990.
P. Varman and K. Doshi, A Parallel Vertex Insertion Algorithm for Minimum Spanning Trees,Theoret. Comput. Sci.,58 (1988), 379–397.
Author information
Authors and Affiliations
Additional information
Communicated by Kurt Mehlhorn.
Rights and permissions
About this article
Cite this article
Pawagi, S., Kaser, O. Optimal parallel algorithms for multiple updates of minimum spanning trees. Algorithmica 9, 357–381 (1993). https://doi.org/10.1007/BF01228509
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01228509