1) minimum support tree
最小支撑树(MST)
2) minimum spanning tree
最小支撑树
1.
In this paper, aiming at the complicated web graph denoted by relation matrix ,based on the analysis of the features of the elements constituting the minimum spanning tree, two methods of getting the minimum spanning tree, method of directly getting and performing on the table, have been put forward.
针对关系矩阵表示的复杂网络图 ,分析构成其最小支撑树的元素特点 ,提出两种求最小支撑树的方法 :直接生成法和表上作业法 。
2.
The arithmetic of that a minimum spanning tree deletes edges with the largest weight is another algorithm,which is on the basis of Kruskal algorithm,Prim algorithm and the Deleting circults.
最小支撑树的一种删除大权边算法是在Kruskal算法、Prim算法和破圈法的基础上,提出的另一种算法。
3.
The model of minimum spanning tree with multiple parameter is established.
建立了多参数最小支撑树问题 (RMST)的模型 ,并证明该问题是 NP-完全的。
3) minimal spanning tree
最小支撑树
1.
This paper narrated and proved an minimal spanning tree algorithm which requires no consideration of circles.
从树的等价定义出发,叙述并证明了一种不必考虑圈的求最小支撑树的算法。
4) Minimum Spanning Tree(MST)
最小生成树(MST)
5) the minimum weight spanning tree with constraints
约束最小支撑树
1.
In this paper,two types of the minimum weight spanning tree with constraints are investigated.
主要研究两类约束最小支撑树问题,即点约束和边约束最小支撑树问题。
6) minimum spanning incoming tree
最小支撑入树
1.
In this paper, we study the propeties of the spanning incoming tree in a digraph network, and propose a simple algorithm for finding the minimum spanning incoming tree in a digraph network, we also present an example for applying this algorithm.
本文研究了有向网络中支撑入树的性质 ,提出了在有向网络图中寻找以某一指定点为根的最小支撑入树的一种较简便的算法 ,并给出了应用该算法的一个实际算
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条