Description: Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the set of edges, the graph coloring problem is the V-K colors into groups, each forming an independent set, that none of them adjacent vertices. Its optimized version is to obtain the minimum value of K.
To Search:
File list (Check if you may need any files):
GCP(图着色问题)\GCPacc1.m
...............\GCPanneal1.m
...............\GCPanneal2.m
...............\GCPgen1.m
...............\b.mat
GCP(图着色问题)
Download