Checking spanning trees optimality using associative parallel processors and its visualization

dc.contributor.author	Nepomniaschaya, A.S.
dc.contributor.author	Borets, T.V.
dc.date.accessioned	2008-09-17T13:18:43Z
dc.date.available	2008-09-17T13:18:43Z
dc.date.issued	2004
dc.identifier.citation	Checking spanning trees optimality using associative parallel processors and its visualization / A.S. Nepomniaschaya, T.V. Borets // Проблеми програмування. — 2004. — N 2,3. — С. 244-250. — Бібліогр.: 9 назв. — англ.	en_US
dc.identifier.issn	1727-4907
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/2312
dc.description.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.	en_US
dc.description.sponsorship	This work was supported in part by the Russian Foundation for Basic Research under Grant N 03-01-00399.	en_US
dc.language.iso	en	en_US
dc.publisher	Інститут програмних систем НАН України	en_US
dc.subject	Параллельное программирование	en_US
dc.subject	Распределенные системы и сети
dc.title	Checking spanning trees optimality using associative parallel processors and its visualization	en_US
dc.type	Article	en_US
dc.status	published earlier	en_US
dc.identifier.udc	681.3