[数] 最小生成树
Use a minimum spanning tree (MST) algorithm for the initialization. This is the default.
使用最小生成树（MST）算法进行初始化。这是默认的。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem , such as minimum spanning tree.
算法设计与分析的经典程序，主要有0-1背包问题，最小生成树等。
The smallest connection problem is widely used in network optimization. The key of solution is to find a minimum spanning tree with rapid and effective algorithm.
最小连接问题在网络优化中有广泛的应用，找到快速有效的算法来构造最小生成树是解决问题的关键。
This paper discusses how to solve Degree- constrained Minimum Spanning Tree Problems by means of genetic algorithm and gives a relative algorithm .
探讨了如何将遗传算法应用于度约束的最小生成树问题，并给出了相应的算法。
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）算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
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问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
While the result of Minimum spanning tree suggested evolution relationship of different plague natural foci.
同时，最小生成树提示了我国不同鼠疫自然疫源地的进化关系。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
本文考虑到节点度的代价问题 ，提出了广义最小生成树的概念 ，并分析了最小生成树在实际应用中的局限性 。
The experiment results show that it is effective on solving Degree- constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods.
对基于图的最小生成树理论的算法进行了改进，新算法在效率和可靠性方面都有所提高；
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.
然后根据相关的优化理论，提出了求解时间目标数学模型的最小生成树算法和求解距离目标数学模型的最小矩形斯坦纳树算法。
The concept of minimum spanning tree is introduced and its limitation is analyzed.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
The multi-criteria Minimum Spanning Tree (mc-MST) problem is typical NP-hard problem and arises in many practical applications.
多目标最小生成树问题是典型的NP难问题。在实际应用中具有广泛的代表性。
Study on the Problem of Constrained Minimum Spanning Tree.
约束最小生成树问题研究。
Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.
文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。
By means of the two methods, the minimum spanning tree can be got directly without drawing the original web graph, which can effectively decrease the inconvenience of the traditional methods.
两种方法不需要作出复杂的网络图，而直接从关系矩阵中生成最小支撑树，从而能有效克服传统方法需绘网络图之不便。
Based on the discussion , efficient parallel algorithms for the shortest paths and the minimum spanning tree are proposed.
并在该模型上给出关于最短路与最小生成树的高效算法，以及在实际并行计算机系统上实现的方法。
The shortest path problem of network is abstracted to a minimum spanning tree problem and the limitations of the minimum spanning tree are analyzed.
将网络最短路径问题抽象为求最小生成树问题，分析了最小生成树在解决实际问题时的局限性，引入了节点的度的概念；
For the cohesion of a person's face in certain high-dimensional space, a new method based on the minimum spanning tree of the nearest cover is proposed.
根据同一人脸的分布在一定的高维空间的类聚性，提出了一种新颖的基于最小生成树的最邻近覆盖方法。
Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.
在最小生成树逻辑结构上建立稳定性度约束模型，给出满足度约束的铺设方案。
Base on solving the problem of degree-constrained minimum spanning tree, we put forward a new method to solving clustering problem.
还在求解度限制树问题的基础上，提出了基于蚂蚁算法的聚类分析方法。
The phylogenetic analysis of microarray data generated a minimum spanning tree that depicted the population structure of the 174 strains.
我们对174株菌的芯片数据进行了系统进化分析后，得到了174个菌株的种系结构图——最小生成树。
As it knows to all, the degree-constrained minimum spanning tree problem is a NP difficulty in the network design and optimization.
度约束最小生成树问题是网络设计和优化中的一个NP难题。
The main work summarized as follows:In chapter two, we have a single point of the constrained minimum spanning tree problem was stu***d.
如何求解网络的度约束最小生成树问题已成为一个好的研究课题。
最小生成树（Minimum Spanning Tree, MST）是图论中的一个核心概念，特指在一个带权重的无向连通图中，寻找一棵连接所有顶点的树（即无环连通子图），并且这棵树的所有边的权重之和最小。
其核心含义与特性如下：
基础定义与目标
G = (V, E)，其中 V 是顶点集合，E 是边集合。(u, v) ∈ E 都有一个权重 w(u, v)（可以是距离、成本、时间等）。T 是 G 的一个子图，它包含 G 的所有顶点（V），并且是一棵树（即连通且无环）。这意味着 T 恰好有 |V| - 1 条边。关键特性
应用场景
经典求解算法
|V| - 1 条边。它利用了贪心策略和并查集（Union-Find）数据结构来高效判断环。, 来源参考：
最小生成树（Minimum Spanning Tree，简称 MST）是图论中的一个核心概念，指在一个带权无向连通图中，边的权重总和最小的生成树。以下是详细解释：
假设一个图有 4 个顶点，边权重如下：
( A-B: 1 ), ( A-C: 2 ), ( B-C: 3 ), ( B-D: 4 ), ( C-D: 5 )
其 MST 的边为 ( A-B ), ( A-C ), ( B-D )，总权重为 ( 1+2+4=7 )。
通过以上算法和性质，MST 在优化问题中具有广泛的理论和实用价值。
【别人正在浏览】