• The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.

    图的邻强边着色算法是一个NP完全问题。

    youdao

  • A mathematical model of the competitive procedure arrangement is designed in this article by using the edge coloring method of graph theory.

    利用图论的边着色理论建立了一个赛程安排的数学模型。

    youdao

  • A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.

    如果在一个图的正常边着色中,相邻两点关联的边集所着的颜色集合不同,则称此正常边着色为相邻强边着色。

    youdao

  • The strong edge coloring of graphs comes from computer science and has a very strong practical background, but it is very difficult to determine its strong chromatic number for any graphs.

    图的强染色来自计算机科学,有着很强的实际背景,但确定图的强色数是非常困难的。

    youdao

  • The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.

    提出并证明了边着色问题的基本定理,设计并实现了闭环dna计算算法。

    youdao

  • The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.

    提出并证明了边着色问题的基本定理,设计并实现了闭环dna计算算法。

    youdao

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

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

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