Associative version of the Gabow algorithm for finding smallest spanning trees with a degree constraint

In this paper by means of an abstract model (the STAR-machine) we describe an associative version of the Gabow algorithm for the degree-restricted problem. We have obtained that on an associative parallel processor this algorithm takes the same time as a minimal spanning tree algorithm. In Appendix the associative algorithm is represented as a procedure written in the language STAR.