By Topic

Efficient implementation of Edmonds' algorithm for finding optimum branchings on associative parallel processors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Nepomniaschaya, A.S. ; Inst. of Comput. Math. & Math. Geophys., Acad. of Sci., Novosibirsk, Russia

We propose an efficient parallel implementation of Edmonds' (1967) algorithm for finding optimum branchings on a model of the SIMD type with vertical data processing (the STAR-machine). To this end for a directed graph given as a list of triples (edge vertices and the weight), we construct a new associative version of Edmonds' algorithm. This version is represented as the corresponding STAR procedure whose correctness is proved. We show that on vertical processing systems Edmonds' algorithm takes O(n log n) time, where n is the number of graph vertices

Published in:

Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on

Date of Conference:

2001