Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
给出了停机位分配问题顶点着色模型及其分解算法。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
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.
为了降低认知系统的通信中断概率，提高认知系统的稳定性，在经典的图论着色模型基础上提出了一种改进的频谱分配算法。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
In the dissertation, DNA sticker algorithm of vertex-coloring problems is given out.
本文给出了图顶点着色问题的DNA粘贴算法。
The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.
提出并证明了边着色问题的基本定理，设计并实现了闭环dna计算算法。
The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.
提出并证明了边着色问题的基本定理，设计并实现了闭环dna计算算法。
应用推荐