Graph vertex coloring problem (GVCP) is a NP-complete problem having good application such as scheduling and timetabling.
本文对图与组合优化问题中的一个典型问题,即图的顶点着色问题进行了研究。
