The cutwidth problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.
图的割宽问题在一般情形下，是NP难的，但对于树的情形有多项式算法。
The cutwidth problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.
图的割宽问题在一般情形下，是NP难的，但对于树的情形有多项式算法。
应用推荐