2007•Journal of Chongqing Institute of TechnologyRequires access
Solving 3 Coloring Problem with Improved Backtracking Algorithm
Qin Li
Open publisher page 0 citations
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.