It is proved that K-Tree Term method is a multinomial time complexity algorithm.

着重证明了K -树组法为多项式时间复杂性算法。

youdao

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

Having analysed the "W-algebra", "K-tree terms" and "MINTY", the three typical methods of generating direct tree terms, the paper advances a new topological one.

本文在对“王氏代数”、“k -树组”和“MINTY”这三种求有向树组的典型方法进行分析之后，提出了一种生成有向树组的拓扑方法。

youdao