The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
Then the algorithms of graph coloring are studied and compared;
然后对图论着色中的几种算法进行了详细研究并比较总结；
We observe the heavy-tailed distribution of cycles in solving some graph coloring instances.
已发现一类着色问题的求解，显现出重尾分布的现象。
Taking an issue in graph coloring as a teaching subject, the paper puts forward a feasible concept in the design of HVE mathematical modeling teaching.
该文通过一个图形着色问题作为教学主题，提出一种比较容易实现的高职数学建模的教学设计理念。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
The watermarking binary is embedded by using the principle of register allocation, constructing the graph coloring model and function and changing the nodes colors in the interfere graph.
利用寄存器分配原理，构造图着色模型和函数，通过修改图结点颜色实现二进制水印信息位的嵌入。
In order to reduce the outage probability and enhance the stability of cognitive system, an improved algorithm of spectrum allocation based on classical graph coloring model was proposed.
为了降低认知系统的通信中断概率，提高认知系统的稳定性，在经典的图论着色模型基础上提出了一种改进的频谱分配算法。
Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
Graph coloring is an important branch of graph theory.
图的染色理论是图论的一个重要分支。
Graph coloring is an important branch of graph theory.
图的染色理论是图论的一个重要分支。
应用推荐