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

A.S Nepomniaschaya

doi:10.1109/icpads.2001.934794

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

A.S Nepomniaschaya

https://doi.org/10.1109/icpads.2001.934794

Copy DOI

Publication Date: Jun 26, 2001

Citations: 6

#Vertical Data Processing #Associative Parallel Processors + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.