network partition problem 网络划分问题
coarsest partition problem 最粗粒度划分问题
set partition problem 集合划分问题
three partition problem 三划分问题
graph partition problem 图划分问题
minimal partition problem 最小分割问题
minimal image partition problem 最小分割问题
Variable problem partition 可变问题划分
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
Coloring problem is indeed a kind of partition problem, and each color class corresponds to one part of the partition.
着色问题实质上就是划分问题，一种色对应于划分的一个部分。
The performance shows that D-CURE algorithm can effectively resolve the clustering partition problem in distributed environment.
实验证明，D-CURE算法可以很好地解决分布式环境下聚类分区问题。
In Chapter 4, we consider the 2-catalog Segmentation problem which is equivalent to some kind of bipartite graph partition problem.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
应用推荐