应用它可以方便且有效地求出一个有向图G的有向树多项式。

Using it the directed tree polynomial of a directed graph G can be found conveniently and efficiently.

youdao

本文研究了这样的特殊情形：树网络上所有起点处于同一条路上，建立了多项式时间算法。

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.

youdao

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

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

youdao