The Minimum Spanning Tree Problem的意思|示意

美 / / 英 / /

最小生成树问题


The Minimum Spanning Tree Problem的网络常见释义

最小支撑树问题 ... 最小支撑树问题(The Minimum Spanning Tree Problem) 最短路问题(The Shortest-Path Problem) 最大流问题(The Maximum Flow Problem) ...

The Minimum Spanning Tree Problem相关例句

Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.

算法设计与分析的经典程序,主要有0 - 1背包问题,最小生成树等。

According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.

根据问题的特征,提出了一个求解最小支撑树问题的DNA算法。

Base on solving the problem of degree-constrained minimum spanning tree, we put forward a new method to solving clustering problem.

还在求解度限制树问题的基础上,提出了基于蚂蚁算法的聚类分析方法。

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 model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.

以寻找最短的加权送电路径为优化目标,将网络重构建模为一个寻找图的局部最小树问题,并计及各种约束。

In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.

提出了求解度约束最小生成树问题的单亲遗传算法。