摘要
对于解决图顶点着色问题，目前较常使用DFS算法，而由于该算法存在效率不高问题，故提出DFS改进算法，极大提高了该算法的效率，对于较难的图顶点着色问题，利用该改进算法更为有利．
Nowadays,the popular method to the problem of how to put m colors on the vertexes of charts is DFS algorithm,but it is inefficient,and need to be improved. The improved algorithm is given. The improved one has more advantage in solving difficult coloring problem in application.
出处
《天津理工学院学报》
1998年第3期59-62,共4页
Journal of Tianjin Institute of Technology
关键词
NP完全问题
DFS算法
着色
图
顶点着色
NP complete problem
Christofides algorithm
DFS algorithm
maximum independence set
