In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题,即是NP完全的。
In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题,即是NP完全的。
应用推荐