图的邻强边着色算法是一个NP完全问题。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
本文给出了图顶点着色问题的DNA粘贴算法。
In the dissertation, DNA sticker algorithm of vertex-coloring problems is given out.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
应用推荐