摘要
应用思维进化计算求解顶点着色问题,给出求解给定图的色数、最小着色的算法。介绍了顶点着色问题的编码与解码方法、特征、信息矩阵的概念,从而应用思维进化计算的趋同和异化求解该问题。实验结果表明该算法是求解顶点着色问题的一种新的有效算法。
Mind evolutionary computation is used in solving vertex coloring problem. A new algorithm of chromatic number and minimal coloring of a given graph is given. An simple and operable method of coding and decoding is designed for vertex coloring problem. A series of concepts, for example character ,information matrix, are introduced. So vertex coloring problem is solved with similartaxis and dissimilation of mind evolutionary computation. The experimental results also show that it is an effective method in sdving vertex coloring problem.
出处
《太原重型机械学院学报》
2004年第3期165-169,共5页
Journal of Taiyuan Heavy Machinery Institute
基金
国家自然科学基金资助(编号:60174002)
山西省青年科学基金资助(编号:20031031)
关键词
点着色
顶点
求解
思维进化计算
色数
信息矩阵
有效算法
编码
趋同
vertex coloring,chromatic number,minimal coloring, mind evolutionary computation,non-numeric optimization
