A DNA Algorithm of Graph Vertex Coloring Problem Based on Multi-separation

In order to deduce operating steps and improve efficient to solve the problems, multi-separation techniques was proposed; a multi-separation model was designed, too. Based on the vast parallelism of sticker model, the problem was solved by using the idea of transforming the problem into satisfiability problem. The multi-separation techniques were implied to solve the graph vertex-coloring problem. The operation steps were given through an instance. And the final coloring schemes were gotten. Consequently, the feasibility of the algorithm and the validity of multi-separation techniques were proved.