Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
Coloring problem is indeed a kind of partition problem, and each color class corresponds to one part of the partition.
着色问题实质上就是划分问题，一种色对应于划分的一个部分。
The coloring problem is always important problem in graph theory. In the discrete mathematics and combinatorial analysis, the coloring problem has a wide range of applications.
图的着色问题一直是图论中的重要问题，并且在离散数学和组合分析中有着重要的应用。
An edge coloring model for this problem is given.
给出了文件传输问题的边着色模型。
Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中，然而寻找图着色所需的最小颜色数目是个NP难题。
The problem could be solved satisfactorily by reducing sampling amount, or increasing coloring times, or increasing the volume of coloring agent.
在采取减少取样量，或增加显色次数，或增加显色剂体积的措施后，问题得到满意解决。
So far, for any graph, the Total Coloring Conjecture is still an open problem.
到目前为止，对于一般的图，全着色猜想仍然是一个公开的问题。
There can be various reasons behind the problem that you can keep in mind for the next coloring process.
问题背后的原因可能多种多样，在你下次选择染发过程的时候要牢记这一问题。
Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
给出了停机位分配问题顶点着色模型及其分解算法。
This paper turns this problem into a mathematical model and resolves it with method of vertex coloring in picture theory, resulting in relatively reasonable algorithms and results.
本文将此问题提炼为一个数学模型，并用图论中已有的顶点染色法解决，得出了较为合理的算法和结果。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
As one of the constrained bin packing problem (BPP), coloring BPP has many important applications such as multi-processor real-time scheduling, etc.
作为经典装箱问题的推广，有色装箱问题在多处理器实时计算机系统的任务调度等实际问题中有着很强的应用背景。
As one of the constrained bin packing problem (BPP), coloring BPP has many important applications such as multi-processor real-time scheduling, etc.
作为经典装箱问题的扩展，有色装箱问题在多处理器实时调度的过程中有很强的应用背景。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
应用推荐