In this paper,we analyzed the drawbacks of using genetic algorithms to deal with the optimal communication spanning tree(OCST)problem Then a novel method based on evolutionary programming was proposed to deal with the problem We also extended the method to the constrained OCST problem Simulation results showed the effectiveness of the metho

Research on bi-criteria minimum spanning tree problem based on ant colony system;

The solution-based DPCNN to the minimum spanning tree of undirected weighted graph;

Degree-constrained minimum spanning tree algorithm based on immune-ant colony algorithm;

A color image segmentation method based on Minimal Spanning Tree and local thresholds;

Application of Minimal Spanning Tree in Supplies of Central Heating;

Prim algorithm of minimal spanning tree and minimum function;

On Algorithm of Producing Minimum Cost Spanning Tree by Method of Seeking Cycles to Romove Its Edge;

The Application of Minimum Cost Spanning Tree to Solve the Question of Urban Highway

The sparse feature difference degree and the minimum cost spanning tree are used to resolve the problem of high attribute dimensional data clustering which exists in information classifying,in order to support the central idea,an example is given in the paper.

MST problems solved by DNA-genetic algorithm;

MST Clustering Algorithm Based on Grid;

A branch and bound algorithm for the CMST problem;