The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.
文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
This paper presents an extended double list storage structure based on a double list storage structure and then applies it to the minimum spanning tree algorithm.
在图的一种双链式存储结构的基础上提出了一种扩展的双链式存储结构。
A new real-time reconfiguration approach for large-scale distribution system, based on the minimum spanning tree algorithm and the switch exchange method, is presented.
提出了一种利用最小树算法和开关交换方法进行大规模配电网重构的新方法。
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)算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
According to the related optimizing theory, the Minimum Spanning Tree arithmetic and the Rectilinear SteinerMinimum Tree arithmetic were selected as the solution of the problem in this thesis.
然后根据相关的优化理论，提出了求解时间目标数学模型的最小生成树算法和求解距离目标数学模型的最小矩形斯坦纳树算法。
In addition, by studying the traffic flow distribution rule in the minimum spanning tree, it is found that the proportion of the minimum spanning tree in the total system is close to a constant.
此外，通过研究最小支撑树上的流量分布规律，发现最小支撑树上流量占总系统流量的比例接近于一个常数。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
The player number decreasing minimum cost spanning tree game.
局中人数目变化的最小费用支撑树对策问题。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for Degree-constrained Minimum Diameter Spanning Tree (D-MDST) problem.
研究了由MSN节点组成的应用层组播网络，讨论了度约束最小直径生成树(D - MDST)问题，并给出了求解该问题的BCT算法。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
The concept of minimum spanning tree is introduced and its limitation is analyzed.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
Study on the Problem of Constrained Minimum Spanning Tree.
约束最小生成树问题研究。
In order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the TSP.
本文提出了一种基于最小生成树的TSP问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm - the CT algorithm, and proposes the improved CT algorithm.
首先，本文有效的分析了度受限的最小直径生成树算法-CT算法，并提出了改进的CT算法。
Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.
针对传感器网络的特点，提出了一种最小传输成本生成树的数据汇聚机制。
Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.
最后，给出了改进的基于划分的聚类方法，以及其中涉及到的最小生成树算法的基本思想。
Base on solving the problem of degree-constrained minimum spanning tree, we put forward a new method to solving clustering problem.
还在求解度限制树问题的基础上，提出了基于蚂蚁算法的聚类分析方法。
Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H (balance compact tree-heuristic) algorithms based on strategy function.
文中着重研究构建最小延迟应用层组播树的算法，提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT - H。
Based on the hypergraph model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sen.
并基于超图模型提出同步无线传感器网络最小生成超树路由算法，以建立数据汇聚的最小能耗树。
Based on the hypergraph model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sen.
并基于超图模型提出同步无线传感器网络最小生成超树路由算法，以建立数据汇聚的最小能耗树。
应用推荐