2025-02-22T09:34:08-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-2312%22&qt=morelikethis&rows=5
2025-02-22T09:34:08-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-2312%22&qt=morelikethis&rows=5
2025-02-22T09:34:08-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T09:34:08-05:00 DEBUG: Deserialized SOLR response
Checking spanning trees optimality using associative parallel processors and its visualization

Checking spanning trees optimality using associative parallel processors and its visualization

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Nepomniaschaya, A.S., Borets, T.V.
Format: Article
Language:English
Published: Інститут програмних систем НАН України 2004
Subjects:
Параллельное программирование
Распределенные системы и сети
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/2312
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.

Similar Items