最小代价生成树,minimum cost spanning tree(MCST)
1)minimum cost spanning tree(MCST)最小代价生成树
1.Secondly,each the neutral residue set with the Prim algorithm to obtain the minimum cost spanning tree(MCST).然后采用普里姆算法对各中性残差点集依次处理,获得相应的最小代价生成树,全部最小代价生成树的边就是相位解缠所需的枝切线。
2)Minimum transmission cost spanning tree最小传输代价生成树
1.The protocol used a data aggregation scheme of minimum transmission cost spanning tree.仿真结果显示,采用最小传输代价生成树的路由协议能减少数据传输量50%-80%,并具有较小的传输时延。
3)minimum routing cost spanning tree最小路由代价生成树
1.Then a method of images mosaicing based onminimum routing cost spanning tree is proposed to calculate global optimum position of every image by constructing theminimum routing cost spanning tree of the mosaicing graph and to create the panoramic image.为了对大规模显微图像进行高质量的拼接,首先提出拼接图的概念及获得高质量全景图像的3个原则,然后采用分块-空间聚类算法配准相邻图像,同时评估配准质量,并计算拼接图的边的权值;最后在此基础上,提出了一种基于最小路由代价生成树的图像拼接方法,该方法通过计算拼接图的最小路由代价生成树来确定所有图像的全局位置,并用来生成全景图像。
4)minimum cost tree最小代价树
5)minimum spanning tree最小生成树
1.Research on bi-criteriaminimum spanning tree problem based on ant colony system;基于蚁群系统的双目标最小生成树算法
2.The solution-based DPCNN to theminimum spanning tree of undirected weighted graph;基于DPCNN的无向赋权图的最小生成树的求解
3.Degree-constrainedminimum spanning tree algorithm based on immune-ant colony algorithm;基于免疫—蚁群算法的度约束最小生成树算法
英文短句/例句
1.The Design and Analysis of Algorithms on the Minimum Spanning Tree and Second-best Minmum Spanning Tree;最小生成树与次小生成树上的算法分析与设计
2.Research of Clustering Algorithm Based on Improved Minimum Spanning Trees;基于改进的最小生成树聚类算法研究
3.A Minimal Spanning Tree based Graph Indexing Algorithm基于最小生成树的图数据库索引算法
4.Improved ACS Algorithm for Solving Degree-Constrained Minimum Spanning Tree求解度约束最小生成树的改进ACS算法
5.Research on Optimum of Minimum Spanning Tree Based on Algorithm of Prim基于Prim算法最小生成树优化的研究
6.Laplacian Spectrum Image Matching Algorithm Based on Minimum Spanning Tree基于最小生成树的LAPLACE谱图像匹配算法
7.MST CLUSTERING ALGORITHM BASED ON OPTIMIZED GRID基于优化网格的最小生成树聚类算法
8.Research on minimum spanning tree based on prim algorithm基于Prim算法的最小生成树优化研究
9.Distribution Network Reconfiguration Based on Minimum Spanning Tree Algorithm基于最小生成树算法的配电网络重构
10.Study of Minimum Spanning Tree Routing Algorithm in LEACH基于最小生成树的LEACH路由算法研究
11.New Algorithm for Minimum Spanning Tree Problem under Maximum Degree Constraint求解最大度约束下最小生成树的新算法
12.Distribution Network Planning Based on Improved Minimum-Cost Spanning Tree Algorihm;基于最小生成树算法的配电网架优化规划
13.A Distribution Network Reconfiguration Algorithm Based on Least Weight Tree for Service Restoration After Faults;基于最小生成树理论的配电网故障恢复算法
14.MST problems solved by DNA-genetic algorithm;基于DNA计算的遗传算法解决最小生成树问题
15.Algorithm Design Based On Fuzziness Expenses Problem of the Minimum Born Tree;基于模糊费用最小生成树问题的算法设计
16.An Adaptive Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem;求解度约束最小生成树问题的自适应遗传算法
17.On Algorithm of Producing Minimum Cost Spanning Tree by Method of Seeking Cycles to Romove Its Edge;利用找环去边法求最小生成树的算法探析
18.The Realization Method of The Kruscal Algorithm of ′Minimun Cost Spaning Tree Problem;最小生成树问题的Kruscal算法的一种实现方法
相关短句/例句
Minimum transmission cost spanning tree最小传输代价生成树
1.The protocol used a data aggregation scheme of minimum transmission cost spanning tree.仿真结果显示,采用最小传输代价生成树的路由协议能减少数据传输量50%-80%,并具有较小的传输时延。
3)minimum routing cost spanning tree最小路由代价生成树
1.Then a method of images mosaicing based onminimum routing cost spanning tree is proposed to calculate global optimum position of every image by constructing theminimum routing cost spanning tree of the mosaicing graph and to create the panoramic image.为了对大规模显微图像进行高质量的拼接,首先提出拼接图的概念及获得高质量全景图像的3个原则,然后采用分块-空间聚类算法配准相邻图像,同时评估配准质量,并计算拼接图的边的权值;最后在此基础上,提出了一种基于最小路由代价生成树的图像拼接方法,该方法通过计算拼接图的最小路由代价生成树来确定所有图像的全局位置,并用来生成全景图像。
4)minimum cost tree最小代价树
5)minimum spanning tree最小生成树
1.Research on bi-criteriaminimum spanning tree problem based on ant colony system;基于蚁群系统的双目标最小生成树算法
2.The solution-based DPCNN to theminimum spanning tree of undirected weighted graph;基于DPCNN的无向赋权图的最小生成树的求解
3.Degree-constrainedminimum spanning tree algorithm based on immune-ant colony algorithm;基于免疫—蚁群算法的度约束最小生成树算法
6)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 ofminimal spanning tree and minimum function;最小生成树的prim算法及minimum函数
延伸阅读
最小生成树最小生成树是由给定的无向图的边的子集组成的树。它有两个性质：它包含图中的每个顶点。它的所有边上的权的总和尽可能小。用式子来表示：
- <math>w(T) = \sum_{(u,v)\in T} w(u,v)</math>
