Abstract

In this paper by means of an abstract model (the STAR-machine) we describe an associative version of the Gabow algorithm for finding smallest spanning trees with a degree constraint. We have obtained that on an associative parallel processor this algorithm takes the same time as a minimal spanning tree algorithm.

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

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.