Abstract
In this paper, we propose an associative parallel algorithm for updating a minimum spanning tree when a vertex and all its incident edges are deleted from the underlying graph. This algorithm is represented as the corresponding procedure implemented on a model of associative parallel systems of the SIMD type with vertical data processing (the STAR–machine). We justify the correctness of this procedure and evaluate its time complexity.
This work was supported in part by the Russian Foundation for Basic Research under Grant 03-01-00399.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chin, F., Houck, D.: Algorithms for Updating Minimum Spanning Trees. J. of Computer and System Sciences 16, 333–344 (1978)
Das, B., Loui, M.C.: Reconstructing a Minimum Spanning Tree after Deletion of Any Node. Algorithmica 31, 530–547 (2001)
Foster, C.C.: Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976)
Johnson, D.B., Metaxas, P.: Connected components in O(log3/2 |V|) parallel time for the CREW PRAM. J. Systems Sci. 54(2), 227–242 (1997)
Johnson, D.B., Metaxas, P.: A parallel algorithm for computing minimum spanning trees. J. Algorithms 19, 383–401 (1995)
Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proc. Amer. Math. Soc. 7, 48–50 (1956)
Nepomniaschaya, A.S.: Language STAR for Associative and Parallel Computation with Vertical Data Processing. In: Mirenkov, N.N. (ed.) Proc. of the Intern. Conf. “Parallel Computing Technologies”, pp. 258–265. World Scientific, Singapore (1991)
Nepomniaschaya, A.S., Dvoskina, M.A.: A Simple Implementation of Dijkstra’s Shortest Path Algorithm on Associative Parallel Processors. In: Fundamenta Informaticae, vol. 43, pp. 227–243. IOS Press, Amsterdam (2000)
Nepomniaschaya, A.S.: Associative parallel algorithms for dynamic edge update of minimum spanning trees. In: Malyshkin, V.E. (ed.) PaCT 2003. LNCS, vol. 2763, pp. 141–150. Springer, Heidelberg (2003)
Nepomniaschaya, A.S.: A New Technique for Updating Tree Paths on Associative Parallel Processors. Bulletin of the Novosibirsk Computing Center, Series: Computer Science (21), 85–97 (2004)
Nepomniaschaya, A.S., Kokosinski, Z.: Associative Graph Processor and its Properties. In: Proc. of the International Conference on Parallel Computing in Electrical Engineering (PARELEC 2004), Dresden, Germany, pp. 297–302. IEEE Computer Society Press, Los Alamitos (2004)
Pawagi, S., Kaser, O.: Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. Algorithmica 9, 357–381 (1993)
Tsin, Y.H.: On Handling Vertex Deletion in Updating Minimum Spanning Trees. Information Processing Letters 27(4), 167–168 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nepomniaschaya, A. (2005). Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_14
Download citation
DOI: https://doi.org/10.1007/11535294_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28126-9
Online ISBN: 978-3-540-31826-2
eBook Packages: Computer ScienceComputer Science (R0)