• Cg vertex coloring process.

    Cg顶点着色程序

    youdao

  • Vertex coloring model and decomposing algorithm of gate assignment problem is offered.

    给出了停机位分配问题顶点着色模型及其分解算法

    youdao

  • 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.

    本文问题提炼一个数学模型,并用已有顶点染色解决得出较为合理算法结果。

    youdao

  • In the dissertation, DNA sticker algorithm of vertex-coloring problems is given out.

    本文给出了图顶点着色问题DNA粘贴算法

    youdao

  • Then it is substituted in burnside formula all vertex-coloring formulas of the regular polyhedron are determined.

    然后伯恩塞德公式,求得所有正多面体顶点着色公式

    youdao

  • The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.

    点可区别关联着色是使得相邻顶点颜色不同的关联着色。

    youdao

  • Then it is substituted in Burnside formula, all vertex-coloring formulas of the regular polyhedron are determined.

    然后伯恩塞德公式,求得所有正多面 体的顶点着色公式

    youdao

  • On the vertex-distinguishing proper edge-coloring of a kind of join graphs;

    给出了路与轮,轮与轮联一类全色数。

    youdao

  • On the vertex-distinguishing proper edge-coloring of a kind of join graphs;

    给出了路与轮,轮与轮联一类全色数。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定