最小生成树

基于局部最小生成树的干涉SAR二维相位展开

Two-Dimensional Phase Unwrapping for Interferometric SAR Based on Local Minimum Spanning Tree

最小生成树算法的PAR方法形式化推导

Formal Derivation of the Minimum Spanning Tree Algorithm with PAR Method

基于GlobalOptimization寻找无向完全图的最小生成树

Finding the minimum spanning trees of undirected complete graph based on global optimization

按图论原理求过m维空间n个点的最小生成树；

Calculate the minimal spanning tree , which passes the points in dimensions space ;

找K个最小生成树的并行算法

A Parallel Algorithm for Finding K Minimum Spanning Trees

最小生成树的prim算法及minimum函数

Prim algorithm of minimal spanning tree and minimum function

求解度约束最小生成树的改进ACS算法

Improved ACS Algorithm for Solving Degree-Constrained Minimum Spanning Tree

基于最小生成树的LEACH路由算法研究

Study of Minimum Spanning Tree Routing Algorithm in LEACH

将GlobalOptimization思想引入到寻找无向完全图最小生成树的问题中，提出了GlobalOptimization算法。

The idea of global optimization is introduced into the problem of finding the minimum spanning trees of ( undirected ) complete graph , then the Global optimization algorithm is represented in the paper .

Prim最小生成树算法的动态优化

Dynamic optimum of minimum span tree 's algorithm devised by Prim

提出一种基于PCA和最小生成树的肿瘤基因表达谱数据的分类算法。

This thesis proposes an algorithm to classify tumor gene expression data based on Principal Component Analysis ( PCA ) and Minimum Spanning Tree theory .

基于Prim算法的最小生成树优化研究

Research on minimum spanning tree based on prim algorithm

基于Mumford-Shah理论的最小生成树图像分割方法

MST Image Segmentation Based on Mumford-Shah Theory

本文基于Adleman模型的生物操作与粘贴模型的解空间，提出的一种求解最小生成树问题的DNA计算机新算法。

We propose a DNA computing algorithm for minimum spanning tree on the basis of biological operation in Adleman model and solution space in sticker model .

求解最小生成树的方法虽然很多，但是利用LINGO建立相应的整数规划模型是一种新的尝试。

The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO .

目前构造最小生成树的算法都是基于传统计算机的算法如Prim算法和Kruskal算法。

Efficient solutions based mainly on classical computers , such as Prim algorithm and Kruskal algorithm , are well-known .

聚类时充分考虑到节点分布的地理信息，自适应地调节聚类的数目，再根据图论中最小生成树的理论，利用Kruskal算法将所有节点划分为k类。

The Clustering takes advantage of geographic information of all nodes to adapt its cluster number , and forms the k clusters based on Minimum Spanning Tree and Kruskal Algorithm .

然后利用Matlab编程进行模拟仿真，通过对股票间的三重最小生成树网络进行抗毁性分析，发现沪市的股票网络对随机攻击具有鲁棒性，而对蓄意攻击显示出脆弱性。

Using Matlab programming to carry out simulation , by analyzing the invulnerability of the triple minimum spanning tree network , it is discovered that when was attacked , the stocks network is robust at rand attack and fragile at intentional attack .

对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。

The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm .

本文介绍了最小生成树的prim算法，minimum函数的实现过程及该函数对由prim算法所得到的最小生成树的影响。

The article introduces prim algorithm of minimal spanning tree , the realization of minimum function and the influence which the function makes upon minimal spanning tree gotten by prim algorithm .

在《数据结构》有关图的章节中，对最小生成树两大算法的解释都是基于MST性质来说明的。

In the chapters on graphs of Data Structure , the statement to the two calculation ways of the minimal produce trees is based on the MST nature .

并针对这些问题提出了一种新的使用信道代理的多信道按密度分群的adhoc网络功率控制协议（MCPCP）和一个使用最小生成树计算区域密度并分群的算法。

A novel multi-channel power control protocol based on density clustering with channel agents in wireless Ad hoc network ( MCPCP ) and a density-based clustering method employing MST are proposed .

MUP算法的最大特点是：1，与其他基于最小生成树的算法的不同之处是不相容边的确定方法。

The features of MUP algorithm are : First , its difference with other MST-based clustering algorithms is the method to determine inconsistent edges .

在给出度约束最小生成树的快速生成方法的基础上，设计了一种启发式交叉求解TSP问题的混合遗传算法。

Based on a fast approximation algorithm proposed by the author for the degree-constrained ( minimum ) spanning tree problem , a hybrid genetic algorithm with heuristic crossover operator for solving Traveling Salesman Problem ( TSP ) is given .

提出了一种关于最小生成树的生成法，该算法与传统的prim算法及kruskal算法比较，有更低的计算复杂性。

Presents an algorithm for finding minimum spanning trees . Compared with the traditional algorithm of Prim and Kruskal , the new algorithm has its own advantage .

本文的研究主要集中于水平集方法、Mumford-Shah模型及最小生成树（简称MST）分割方法这些可以用于多相分割的方法中。

This dissertation presented some studies concentrated in these topics : the level set method , the Mumford-Shah model , the minimum spanning tree ( MST ) based segmentation method .

根据最小生成树（MST）算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。

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 .

利用动态聚类分析、最小生成树、主成分分析等模式识别方法，对含ZnO半导体材料的样本集中各样本之间在300K时的晶格匹配与热匹配程度进行了分析。

Some pattern recognition methods including dynamic clustering analysis , minimal spanning tree and principal component analysis have been used to recognize the extents of both lattice-match and thermo-match at 300K for the samples containing ZnO semiconductor material .

基于最小生成树思想改进后的KK-MEANS聚类方法研究及其在地震数据集中的应用

KK-means Clustering Method Improved Based-on Minimum Cost Spanning Tree and Its Applications in Seismic Data

基于图像分割的盲检测算法利用水印实际嵌入的局部性，对待测图像进行分割，研究区域最小生成树中节点的度的分布，根据Fisher鉴别准则对待测图像实现数字水印盲检测。

The algorithm based on image segmentation utilizes the locality property of actual watermarking to segment the test images . It studies the distribution of node degree in MSTs . It carries out blind detection on digital watermarking according to Fisher principle .