| 利用改进的回溯算法求解3着色问题 |
| |
| 引用本文： | 唐贵 鲁珊珊 李秦. 利用改进的回溯算法求解3着色问题[J]. 重庆理工大学学报(自然科学版), 2007, 21(23): 116-118 |
| |
| 作者姓名： | 唐贵 鲁珊珊 李秦 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院,兰州730070 |
| |
| 摘 要： | 介绍了3着色问题，阐述了回溯算法与静态搜索树，提出了动态搜索树的概念，给出了一个基于动态搜索树的回溯算法，以3着色问题为例，说明该算法所用时间少于静态搜索树方法．
|
| 关 键 词： | 3着色问题 动态搜索树 回溯算法 |
| 文章编号： | 1671-0924（2007）12-0116-03 |
| 收稿时间： | 2007-10-12 |
Solving 3 Coloring Problem with Improved Backtracking Algorithm |
| |
| TANG Gui, LU Shan-shan, LI Qin. Solving 3 Coloring Problem with Improved Backtracking Algorithm[J]. Journal of Chongqing University of Technology(Natural Science), 2007, 21(23): 116-118 |
| |
| Authors: | TANG Gui LU Shan-shan LI Qin |
| |
| Abstract: | This paper introduces the three coloring problem, expounds upon backtracking algorithm and static search tree, puts forward the concept of dynamic search tree, and proposes a backtracking algorithm based on a dynamic search tree. 3 coloring problem is used as an example to illustrate that the new algorithm is more effective on exhausted time. |
| |
| Keywords: | 3 coloring problem dynamic search tree backtracking algorithm |
| 本文献已被 维普 等数据库收录！ |
