应用它可以方便且有效地求出一个有向图G的有向树多项式。
Using it the directed tree polynomial of a directed graph G can be found conveniently and efficiently.
本文研究了这样的特殊情形：树网络上所有起点处于同一条路上，建立了多项式时间算法。
In this paper we study such a special case: a tree network with all sources on a path and we present its polynomial-time algorithms.
着重证明了K -树组法为多项式时间复杂性算法。
It is proved that K-Tree Term method is a multinomial time complexity algorithm.
图的割宽问题在一般情形下，是NP难的，但对于树的情形有多项式算法。
The cutwidth problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用刘彦佩提出的嵌入的联树模型，得出了两类新的四正则图的完全亏格多项式，并推导出已有结果的两类图的完全亏格多项式。
In this paper, We obtain the total genus polynomials for two new classes of 4-regular graphs by using the joint tree model of a graph embedding introduced by Yanpei Liu.
作者在第一章提出了多项式树的概念，给基函数的构造找到一条直观的思路。
With the introduction of the concept of polynomial tree, the article studies the construction problem of polynomial basis from a broader sense of perspective.
作者在第一章提出了多项式树的概念，给基函数的构造找到一条直观的思路。
With the introduction of the concept of polynomial tree, the article studies the construction problem of polynomial basis from a broader sense of perspective.
应用推荐