Using it the directed treepolynomial of a directed graph G can be found conveniently and efficiently.
应用它可以方便且有效地求出一个有向图G的有向树多项式。
2
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.
本文研究了这样的特殊情形：树网络上所有起点处于同一条路上，建立了多项式时间算法。
3
With the introduction of the concept of polynomialtree, the article studies the construction problem of polynomial basis from a broader sense of perspective.