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.
在第四章，我们研究二目录分割问题，它等价于一个基于二部图上的某种划分问题。
Then the assignment problem is illustrated with the directed acyclic graphs. The assignment problem becomes the partition problem of directed acyclic graphs.
接着把这一特殊的指派问题用有向无回路图表示出来，从而使指派问题的求解转化为求解有向无回路图的划分问题。
To the partition problem, the particular neighbourhood structure is constructed. A simulated annealing algorithm with the neighbourhood structure is devised.
针对划分问题，构建了一种特殊的邻域结构，并设计出基于此邻域结构的模拟退火算法。
There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.
七号信令网拓扑优化中存在高级信令转接点（HSTP）的A/B平面划分问题，其可归纳为一类新的图的划分问题。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
Considering the communication characteristics of switched industrial Ethernet, genetic algorithms are used to find near-optimal solution for its network partition problem.
针对交换式工业以太网的数据通信特点，采用遗传算法来寻找其网络划分问题的次优解。
On this bases, similar matrix and similar interval are proposed in combination with rough set theory. They are useful in knowledge partition problem in incomplete information system.
在此基础上结合粗糙集理论提出了相似矩阵、相似区间的概念，并将其应用于不完备信息系统知识分类的问题中。
The set partition problem is a typical NP-Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem.
集合划分问题是一个典型的NP完全问题，建立了集合划分问题的优化数学模型，采用蚁群算法解决了此问题。
The set partition problem is a typical NP-Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem.
集合划分问题是一个典型的NP完全问题，建立了集合划分问题的优化数学模型，采用蚁群算法解决了此问题。
应用推荐