| 1. | A mst based clustering method with controlling vertexes
一种带控制节点的最小生成树聚类方法 |
| 2. | Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 |
| 3. | An algorithm for finding minimum spanning trees and comparison with other algorithm
求最小生成树的另一算法及其与其它算法的比较 |
| 4. | Minimum spanning tree
最小生成树 |
| 5. | The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成树算法在多元连接中的应用及算法分析 |
| 6. | On the models of graph theory based on minimum spanning tree with applications in medicine
基于最小生成树的图论模型及其在医学中的应用 |
| 7. | Series of numerical examples are tested and the results are compared with that of some other algorithms
在最小生成树的基础上，将超过度约束的顶点降低度数使之满足度约束条件。 |
| 8. | At the same time , a fast heuristic algorithm of mimimum cost tree with delay constraint are presented , its time complexity is ( pn2 )
同时还提出了一种满足延迟约束的多播最小生成树算法（时间复杂度为( pn2 ) ） 。 |
| 9. | A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods . 2
对基于图的最小生成树理论的算法进行了改进，新算法在效率和可靠性方面都有所提高； 2 |
| 10. | The algorithm starts with generating a minimum spanning tree to find basic route , and then select , an adjustable unit to modify and determine the final routes
该算法从构造最小生成树开始，找出基本线路；然后通过选择可调单元调整线路得到优化的线路。 |
