strong_np_complete_problem_有道手机词典

1.The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
dict.yoduao.com