An Algorithm for the Minimum Spanning Tree Problem with Uncertain Structures

The minimum spanning tree problem consists to find the smallest weight among all possible trees in a network. It is one of the main problems of graphs theory, since it has a wide range of applications in Engineering and Computation areas, such as: electricity distribution networks, information storage, transportation, etc. In this paper is proposed an exact algorithm to the minimum spanning tree problem with uncertain structures. It is based on the mainly papers of the literature and presents a solution ordered set of minimum spanning trees. The uncertainties of the structures are resolved using the fuzzy sets theory. The algorithm was tested on literature instances having the same results. Its complexity is O((v-a)(v^2)), where v is the node sets and a is the arcs sets.