graph coloring theory

基本解釋

The coloring problem of graph theory is combined with an improved ant colony algorithm to plan optimally the overhaul.
在優(yōu)化的過(guò)程中采用了改進(jìn)的蟻群算法，并結(jié)合了圖論中的圖著色問(wèn)題。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于圖著色理論的頻譜分配算法，提出一種改進(jìn)的最大效用頻譜分配算法。
A mathematical model of the competitive procedure arrangement is designed in this article by using the edge coloring method of graph theory.
利用圖論的邊著色理論建立了一個(gè)賽程安排的數(shù)學(xué)模型。

圖著色理論
What’s more, we introduce the allocation models based on the game theory, the graph coloring theory and the competitive auction theory, and there is comparison between them.
并且介紹了基于博弈論、拍賣(mài)競(jìng)價(jià)理論和圖著色理論等經(jīng)濟(jì)學(xué)和數(shù)學(xué)理論模型現(xiàn)有的典型的頻譜分配算法,并進(jìn)行對(duì)比和分析。
計(jì)算機(jī)科學(xué)技術(shù)
圖著色理論
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于圖著色理論的頻譜分配算法，提出一種改進(jìn)的最大效用頻譜分配算法。