Associative parallel algorithm for dynamic reconstruction of a minimum spanning tree after deletion of a vertex

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. © Springer-Verlag Berlin Heidelberg 2005.