全部

1·Study on the Problem of Constrained Minimum Spanning Tree.

约束最小生成树问题研究。

2·The concept of minimum spanning tree is introduced and its limitation is analyzed.

介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。

3·The initial clustering structure is constructed by using the minimum spanning tree method.

然后使用最小生成树方法得到聚类的初始结构；

4·Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.

文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。

5·The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.

实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。

6·According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.

根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。

7·In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.

本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。

8·Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.

算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。

9·In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.

提出了求解度约束最小生成树问题的单亲遗传算法。

10·The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.

以寻找最短的加权送电路径为优化目标，将网络重构建模为一个寻找图的局部最小树问题，并计及各种约束。