Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Jishou University(Natural Sciences Edition)》 2008-05
Add to Favorite Get Latest Update

Vertex Coloring of a Graph Based on Genetic and Heuristics Search Algorithm

LIAO Hui-chuan (School of Information Engineering,East China Jiaotong University,Nanchang 330013,China)  
Graph coloring is a typical NP-completely problem.This paper puts forward a new method of vertex coloring of a graph based on genetic algorithm and heuristics search algorithm.This algorithm involves the coding methods of chromosome,the design of fitness function and the selection operators.Experiments show that this new algorithm can improve time complexity and obtain solutions of excellent quality.
【Fund】: 华东交通大学科研基金资助项目(07XX01)
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved