A distributed algorithm for generation of the Kth best spanning tree

Abstract

The problem at hand is to try and construct k spanning trees for a weighted connected graph, such that the weight of each constructed tree is less than a given w. This problem is called the kth best spanning tree problem. The sequential algorithm used is based on the procedure described by Maycda and Scshu. A distribution strategy for the parallel algorithm has been given. Spccdups for graph sizes varying from 5 vertices to 13 vertices have been shown and ana­ lyzed. Spccdups show that the distributed algorithm is cer­ tainly faster than the sequential algorithm, but also identify a bottleneck. All programs were implemented on the IN­ TEL iPSC/2.