中英▼
go top

partial k-tree 添加释义

网络释义专业释义英英释义

  偏k

偏k-树

基于1个网页-相关网页

短语

partial k tree 偏k

a partial k-tree 偏k

  • 偏k-树 - 引用次数：6

    This paper studies the relaxed game chromatic number of partial k-tree with the relaxed degree d. The concept of the relaxed game chromatic number of a graph was firstly introduced by Chou, Wang and Zhu in 1.

    本文主要研究的是偏k-树在松弛度为d的情况下的松弛竞赛色数问题。

    参考来源 - 一个新的激活策略在偏K—树上的应用

·2,447,543篇论文数据，部分数据来源于NoteExpress

Partial k-tree

  • abstract: In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard combinatorial problems on graphs are solvable in polynomial time when restricted to the partial k-trees, for bounded values of k.

以上来源于: WordNet

双语例句

  • We determine in this paper the treewidth of the product of a tree and a k-connected partial k-tree, where a partial k-tree is a graph with treewidth k.

    本文确定了一棵树与一个k -连通偏k -树的乘积图的树宽。其中，偏k -树是一个树宽为k的图。

    youdao

更多双语例句
$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块？

感谢您的反馈，我们会尽快进行适当修改！
进来说说原因吧 确定
小调查
请问您想要如何调整此模块？

感谢您的反馈，我们会尽快进行适当修改！
进来说说原因吧 确定