A Study on Fuzzy a-Minimum Edge Wighted Spanning Tree with Cut Property Algorithm

摘要

The minimum spanning tree problem (Graham and Hell 1985) is one of the most typical problems in combinatorial optimization. It has many applications in communication network (Chiang, Liu, and Huang 2007), statistical cluster analysis (Gower and Ross 1969), image processing (Osteen and Lin 1974), etc. For instance, in network routing protocols, the minimum cost spanning tree is one of the most effective methods to broadcast the messages from a source node to a set of destinations.