| 新着色算法的研究 |
| |
| 引用本文： | 赵元哲,刘志镜.新着色算法的研究[J].西安电子科技大学学报,1995,22(4):454-457. |
| |
| 作者姓名： | 赵元哲 刘志镜 |
| |
| 作者单位： | 西安电子科技大学计算中心 |
| |
| 摘 要： | 在点着色问题中，引入一种新方法，即使用补图和团覆盖的概念解决繁杂的点着色问题，它比普通的加边缩边法和纵深搜索法现为简便，在一定程度上降低了运算复杂度。该算法本身明了，既适于比较简单的图，又适用于比较复杂的图。同时，文中还给出了与团覆盖对应的独立集结构的乍法及其复杂度估算。
|
| 关 键 词： | 点着色 补图 团覆盖 算法 图 |
A new research for the coloring algorithm |
| |
| Zhao Yuanzhe Lin Zhijing Song Li.A new research for the coloring algorithm[J].Journal of Xidian University,1995,22(4):454-457. |
| |
| Authors: | Zhao Yuanzhe Lin Zhijing Song Li |
| |
| Abstract: | In this paper,a new method of using the complement graph and clique covering to solvethe complex vertex coloring problem is introduced,which is much simpler than the commonadd-decrease edges and DFS algorithms. It also reduces the computing complexity.The algo-rithm is simple,but it is suitable for the simple graph and the large graph.An independent-setstructure algorithm which is related with the clique covering is given. |
| |
| Keywords: | vertex coloring complement graph clique covering algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
