摘要
介绍了3着色问题,阐述了回溯算法与静态搜索树,提出了动态搜索树的概念,给出了一个基于动态搜索树的回溯算法,以3着色问题为例,说明该算法所用时间少于静态搜索树方法.
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.
出处
《重庆工学院学报》
2007年第23期116-118,共3页
Journal of Chongqing Institute of Technology
关键词
3着色问题
动态搜索树
回溯算法
3 coloring problem
dynamic search tree
backtracking algorithm
