Checking spanning trees optimality using associative parallel processors and its visualization
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Checking spanning trees optimality using associative parallel processors and its visualization
|
|
| Creator |
Nepomniaschaya, A.S.
Borets, T.V. |
|
| Subject |
Параллельное программирование
Распределенные системы и сети |
|
| Description |
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. |
|
| Date |
2008-09-17T13:18:43Z
2008-09-17T13:18:43Z 2004 |
|
| Type |
Article
|
|
| Identifier |
Checking spanning trees optimality using associative parallel processors and its visualization / A.S. Nepomniaschaya, T.V. Borets // Проблеми програмування. — 2004. — N 2,3. — С. 244-250. — Бібліогр.: 9 назв. — англ.
1727-4907 http://dspace.nbuv.gov.ua/handle/123456789/2312 681.3 |
|
| Language |
en
|
|
| Publisher |
Інститут програмних систем НАН України
|
|