1) Minimal Spanning Tree Pruning
最小生成树剪枝
2) minimum spanning tree
最小生成树
1.
Research on bi-criteria minimum spanning tree problem based on ant colony system;
基于蚁群系统的双目标最小生成树算法
2.
The solution-based DPCNN to the minimum spanning tree of undirected weighted graph;
基于DPCNN的无向赋权图的最小生成树的求解
3.
Degree-constrained minimum spanning tree algorithm based on immune-ant colony algorithm;
基于免疫—蚁群算法的度约束最小生成树算法
3) minimal spanning tree
最小生成树
1.
A color image segmentation method based on Minimal Spanning Tree and local thresholds;
基于最小生成树和局部阈值的彩色图像分割方法
2.
Application of Minimal Spanning Tree in Supplies of Central Heating;
最小生成树问题在暖气供应建设中的应用
3.
Prim algorithm of minimal spanning tree and minimum function;
最小生成树的prim算法及minimum函数
4) minimum cost spanning tree
最小生成树
1.
On Algorithm of Producing Minimum Cost Spanning Tree by Method of Seeking Cycles to Romove Its Edge;
利用找环去边法求最小生成树的算法探析
2.
The Application of Minimum Cost Spanning Tree to Solve the Question of Urban Highway
最小生成树在城市高速公路问题中的应用
3.
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.
针对文本信息聚类中的高属性维稀疏数据聚类问题,采用计算对象间稀疏特征差异度来度量文本对象之间的相关度,结合最小生成树的方法来进行聚类分析,提出一种基于稀疏特征差异度的聚类方法。
5) MST
最小生成树
1.
MST problems solved by DNA-genetic algorithm;
基于DNA计算的遗传算法解决最小生成树问题
2.
MST Clustering Algorithm Based on Grid;
基于网格的最小生成树聚类算法
3.
A branch and bound algorithm for the CMST problem;
流量约束最小生成树问题的分枝定界算法
6) Minimum Spanning Tree(MST)
最小生成树
1.
To resolve the NP-complete problem of Minimum Spanning Tree(MST) calculations and meet the performance requirements in actualnetwork environment, a distributed algorithm for searching the MST is proposed.
为解决最小生成树(MST)算法中的NP完全问题,使之适应实际网络环境的性能需求,提出一种寻求MST的分布式算法。
2.
The minimum spanning tree(MST) was used to obtain the best connected-component of the image set to recover the transformation between images and project the images into the mosaic frame.
根据最小生成树(MST)算法获得图像序列的连通分量,得到图像对之间的变换矩阵并将图像映射到拼接平面。
3.
Pearson\'s correlation coefficient was used to compute the correlation matrix of price fluctuations,and then this matrix was taken as the adjacent matrix of a weighted-complete-graph,to construct the correlation network/tree of stocks using an improved Minimum Spanning Tree(MST) algorithm.
以汶川地震前后中国股市的股价波动时间序列作为研究对象,利用皮尔森相关系数计算得到股价波动的相关矩阵,并将其看作一加权完全图的邻接矩阵,采用改进后的最小生成树算法,建立股市相关性网络(树)。
补充资料：最小生成树
最小生成树是由给定的无向图的边的子集组成的树。它有两个性质：
- 它包含图中的每个顶点。
- 它的所有边上的权的总和尽可能小。
用式子来表示：
- <math>w(T) = \sum_{(u,v)\in T} w(u,v)</math>
这里w(T)表示最小的总权值，(u,v) 表示定点u和v之间的边。
最小生成树的生成有两种方法，普里姆(Prim)算法，和克鲁斯卡尔(Kruskal)算法。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条