four coloring algorithm 四着色算法
graph-coloring algorithm 图形着色演算法
improved graph-coloring algorithm 改进图染色算法
4-coloring algorithm 四着色算法
page coloring algorithm 页面着色算法
node coloring algorithm 图着色分配算法
sequential coloring algorithm 依次着色算法
graph edge coloring algorithm 图的边着色
coloring packetmarking algorithm 着色包标记算法
We take full advantage of a branch-and-bound algorithm and map-coloring algorithm advantages, teachers, classes and the rational allocation of time to bring a better ability to deal with problems, a certain validity and applicability.
本文充分利用了分枝定界算法与图边着色算法的优势,对于教师、班级和时间的合理分配带来了较好的处理问题能力,具有一定可行性和适用性。
参考来源 - 教务排课系统的设计与实现·2,447,543篇论文数据，部分数据来源于NoteExpress
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完全问题。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
应用推荐