1) graph coloring theory
图着色理论
2) graph coloring
图论着色
1.
Based on the combination of graph coloring model and the concept of spectrum quality grading, the proposed algorithm allocated the available spectrum to cognitive radio cells to meet demand maximally under QoS guarantee.
使用图论着色模型,结合频谱质量分级概念,根据小区内需求情况,该算法将网络中周期检测到的可用频谱分配给各个认知小区,最大化满足需求的同时,为业务提供服务质量保障。
2.
Cognitive radio spectrum assignment based on quantum genetic algorithm is propos ed, and simulations are conducted to compare the proposed method with color sensi tive graph coloring algorithm.
提出了基于量子遗传算法的认知无线电频谱分配算法,通过仿真比较了本文算法与颜色敏感图论着色频谱分配算法的性能。
3) chromatic theory of graph
着色理论
1.
The paper is mainly about the application of chromatic theory of graph in the study of scheduling times of AGVS and provide an efficient method of the problem of AGVS.
针对目前AGVS(自动导引小车系统)的调度问题的研究现状,为解决AGVS在FMS(柔性制造系统)中的调度次数最优化的问题,文章提出通过图的着色理论来研究满足一定约束的AGVS中调度问题,为满足此类约束条件的AGVS,给出一种行之有效的方法。
6) graph coloring
图着色
1.
Research on algorithm of graph coloring by using cellular neural networks;
图着色问题的细胞神经网络算法研究
2.
Anti-collision algorithm based on neural network graph coloring
基于神经网络图着色的阅读器防冲突算法
3.
A computational approach for identifying lower and higher order gene logic associations was presented on the base of graph coloring theory and applied it to the colon cancer mRNA microarray data.
首先,根据图着色原理确定了基因的低阶和高阶逻辑关系,然后应用结肠癌基因表达谱数据分析了51个癌基因和抑癌基因的逻辑关系,在此基础上构建了结肠癌基因表达的逻辑网络。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条