Institutional Repository
| using hajos construction to generate hard graph 3-colorability instances | |
| Liu Sheng; Zhang Jian | |
| 2006 | |
| Conference Name | 8th International Conference on Artificial Intelligence and Symbolic Computation |
| Pages | 211-225 |
| Conference Date | SEP 20-22, |
| Conference Place | Beijing, PEOPLES R CHINA |
| Indexed Type | SCI |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 3-540-39728-0 |
| Department | Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China. Grad Univ, Chinese Acad Sci, Beijing 100049, Peoples R China. |
| English Abstract | In this paper we propose a constructive algorithm using constraint propagation to generate 4-critical graph units (4-CGUs) which have only one triangle as subgraph. Based on these units we construct 4-critical graphs using Hajos join construct |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/12126 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Liu Sheng,Zhang Jian. using hajos construction to generate hard graph 3-colorability instances[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS,2006:211-225. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment