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

    着色算法一个NP完全问题

    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

  • 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

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

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

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