Efficient Implementation of Edmonds' Algorithm for Finding Optimum Branchings on Associative Parallel Processors

Authors:
A. S. Nepomniaschay
Affiliations:
-
Venue:
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Year:
2001

Citing 0
Cited 3

Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae
Low-complexity coding and source-optimized clustering for large-scale sensor networks

ACM Transactions on Sensor Networks (TOSN)
Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In this paper we propose an efficient parallel implementation of Edmonds' 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 obtain that on vertical processing systems Edmonds' algorithm takes O(n log n) time, where n is the number of graph vertices.