First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm - the CT algorithm, and proposes the improved CT algorithm.
首先，本文有效的分析了度受限的最小直径生成树算法-CT算法，并提出了改进的CT算法。
Most of the Spanning Tree Algorithm(STA) failures occur due to the excessive loss of BPDUs causing the blocked ports to transition to forwarding mode.
大多的生成树算法（STA）失败发生由于过多的丢失BPDU导致阻塞端口转换为转发模式。
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.
提出了一种利用最小树算法和开关交换方法进行大规模配电网重构的新方法。
This paper studied the protection mechanism for virtual ring in mesh topology, and analyzed a construction algorithm for a virtual ring based on 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 problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
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算法。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.
本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
Based on the analysis of the existing algorithm of MAC address forwarding table, it presents a kind of new physical topology discovery algorithm depended on spanning tree protocol.
在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.
最后，给出了改进的基于划分的聚类方法，以及其中涉及到的最小生成树算法的基本思想。
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问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
Based on the hypergraph model, the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sen.
并基于超图模型提出同步无线传感器网络最小生成超树路由算法，以建立数据汇聚的最小能耗树。
To compute the page accessibility, a Path Tree Spanning Algorithm (PTSA) was introduced.
为计算网页可达性，设计了计算到达网页路径的路径树生成算法（PTSA）。
The proposed localization algorithm first generates clusters and a spanning tree consisting of cluster heads, and then the cluster head computes local coordinates of all member nodes in the cluster.
着重设计了一种基于二跳生成树的可扩展分簇定位算法。首先对传感器网络进行分簇、并利用簇头节点构造一个二跳生成树；
Algorithm for construct ALM spanning tree which is applied in stream media living broadcast is introduced.
详细介绍了适合流媒体直播的应用层组播树构造算法，并分析了其优缺点。
Algorithm for construct ALM spanning tree which is applied in stream media living broadcast is introduced.
详细介绍了适合流媒体直播的应用层组播树构造算法，并分析了其优缺点。
应用推荐