| 图顶点m着色的改进算法 |
| |
| 引用本文： | 李文,王哲明,刘林. 图顶点m着色的改进算法[J]. 天津理工大学学报, 1998, 0(3) |
| |
| 作者姓名： | 李文 王哲明 刘林 |
| |
| 作者单位： | 天津理工学院计算机系!300191 |
| |
| 摘 要： | 对于解决图顶点着色问题，目前较常使用DFS算法，而由于该算法存在效率不高问题，故提出DFS改进算法，极大提高了该算法的效率，对于较难的图顶点着色问题，利用该改进算法更为有利．
|
| 关 键 词： | NP完全问题 Christofides算法 DFS算法 极大独立集 |
Improved Algorithms on how to Put m Colors on the Vertexes of Charts |
| |
| Li Wen, Wang Zhemin, Lu Lin. Improved Algorithms on how to Put m Colors on the Vertexes of Charts[J]. Journal of Tianjin University of Technology, 1998, 0(3) |
| |
| Authors: | Li Wen Wang Zhemin Lu Lin |
| |
| Affiliation: | Tianjin Insititute of Technology Tianjin 300191 |
| |
| Abstract: | 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. |
| |
| Keywords: | NP complete problem Christofides algorithm DFS algorithm maximum independence set |
| 本文献已被 CNKI 等数据库收录！ |
