ISS Library

CHECKING SPANNING TREES FOR OPTIMALITY USING ASSOCIATIVE PARALLEL PROCESSORS AND ITS VISUALIZATION

Nepomniaschaya A. S. and Borets T. V. (2004) CHECKING SPANNING TREES FOR OPTIMALITY USING ASSOCIATIVE PARALLEL PROCESSORS AND ITS VISUALIZATION. In: УкрПрог, 1-3 июня 2004 г., г. Киев, Украина.

[img]MS Word
249Kb

Abstract

In this paper, by means of an abstract model of the SIMD type with vertical data processing (the STAR-machine), we present a simple associative parallel algorithm for implementing the criterion of Chin and Houck to verify minimal spanning trees in undirected graphs. This algorithm is given as the corresponding STAR procedure CST whose correctness is proved and time complexity is evaluated. We also provide an experiment of verifying two spanning trees for optimality in a given undirected graph.

Item Type:Conference or Workshop Item (Paper)
Subjects:I. Computing Methodologies
ID Code:244
Deposited By:G.U. Volkova
Deposited On:13 Nov 2007 13:56
Last Modified:13 Nov 2007 13:56

Repository Staff Only: item control page