摘要
DNA计算是一种新的并行计算模式,在解决NP完全问题等方面具有很大的优越性.利用DNA计算的计算特性给出了一个图的k着色问题的DNA计算模型,该算法最多需要(3kn(n-1))/2+6个生物操作即可求出图的色数及相应的着色模式.
DNA computing is a new parallel computing model, which has shown some advantages in solving many NP-complete problems. In this paper, a DNA computing model is given for solving the graph k-coloring problem. For the algorithm of the model, the chromatic number and the coloring mode of a graph can be obtained wit 3kn（n-1）/2＋6 biological operations at most.
出处
《徐州师范大学学报（自然科学版）》
CAS
2009年第3期42-44,共3页
Journal of Xuzhou Normal University(Natural Science Edition)
基金
淮海工学院科研基金资助项目(KK06039)
