【degree_diameter_problem】什么意思_英语degree_diameter_problem的翻译_音标_读音_用法_例句_在线翻译

degree diameter problem 添加释义

abstract: In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is bounded above by the Moore bound; for 1 < k and 2 < d only the Petersen graph, the Hoffman-Singleton graph, and maybe a graph of diameter k = 2 and degree d = 57 attain the Moore bound.

以上来源于: WordNet

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算法。

youdao
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算法。

youdao
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.

本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。

youdao

更多双语例句

应用推荐

$firstVoiceSent

- 来自原声例句