Theorem 1. The induced matching 2-partition problem for graphs having diameter 6 is NP-complete.
定理1.直径为6的图的导出匹配2-划分问题是NP-完全的。
参考来源 - 图的广义着色·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
Partition problem is fundamental to many VLSI CAD.
划分问题是VL SI - CAD设计中的基本问题。
You are facing a more generalized problem of the Partition problem, which is NP-Complete.
你正面临一个更广义的问题分区的问题,这是非完全多项式。
Coloring problem is indeed a kind of partition problem, and each color class corresponds to one part of the partition.
着色问题实质上就是划分问题,一种色对应于划分的一个部分。
应用推荐