On handling vertex deletion in updating spanning trees
Information Processing Letters
A parallel algorithm for computing minimum spanning trees
Journal of Algorithms
Connected components in O(log3/2n) parallel time for the CREW PRAM
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
A simple implementation of Dijkstra's shortest path algorithm on associative parallel processors
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Content Addressable Parallel Processors
Content Addressable Parallel Processors
Associative Graph Processor and Its Properties
PARELEC '04 Proceedings of the international conference on Parallel Computing in Electrical Engineering
Supporting the application of situated cellular agents in non-uniform spaces
Future Generation Computer Systems - Special issue: Parallel computing technologies
Supporting the application of Situated Cellular Agents in non-uniform spaces
Future Generation Computer Systems - Special issue: Parallel computing technologies
| Hi-index | 0.00 |
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.