Vertex coloring model and decomposing algorithm of gate assignment problem is offered.
给出了停机位分配问题顶点着色模型及其分解算法。
This paper turns this problem into a mathematical model and resolves it with method of vertex coloring in picture theory, resulting in relatively reasonable algorithms and results.
本文将此问题提炼为一个数学模型，并用图论中已有的顶点染色法解决，得出了较为合理的算法和结果。
In the dissertation, DNA sticker algorithm of vertex-coloring problems is given out.
本文给出了图顶点着色问题的DNA粘贴算法。
Cg顶点着色程序。
Then it is substituted in burnside formula all vertex-coloring formulas of the regular polyhedron are determined.
然后代入伯恩塞德公式，求得所有正多面体的顶点着色公式。
The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.
邻点可区别关联着色是使得相邻顶点的颜色集不同的关联着色。
Then it is substituted in Burnside formula, all vertex-coloring formulas of the regular polyhedron are determined.
然后代入伯恩塞德公式，求得所有正多面 体的顶点着色公式。
Then it is substituted in Burnside formula, all vertex-coloring formulas of the regular polyhedron are determined.
然后代入伯恩塞德公式，求得所有正多面 体的顶点着色公式。
应用推荐