Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees
In this paper we propose two associative parallel algorithms for the edge update of a minimum spanning tree when an edge is deleted or inserted in the underlying graph. These algorithms are represented as the corresponding procedures implemented on a model of associative parallel systems of the SIMD type with vertical data processing (the STAR–machine). We justify correctness of these procedures and evaluate their time complexity.
KeywordsUndirected Graph Minimum Span Tree Tree Path Underlying Graph Tree Edge
Unable to display preview. Download preview PDF.
- 3.Foster, C.C.: Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976)Google Scholar
- 5.Krikelis, A., Weems, C.C.: Associative Processing and Processors. IEEE Computer Society Press, Los Alamitos (1997)Google Scholar
- 6.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, Singapure (1991)Google Scholar
- 8.Nepomniaschaya, A.S.: Comparison of Performing the Prim-Dijkstra Algorithm and the Kruskal Algorithm on Associative Parallel Processors. Cybernetics and System Analysis, Kiev, Naukova Dumka (2), 19–27 (2000) (in Russian. English translation by Plenum Press)Google Scholar