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.

GCP(图着色问题)\GCPacc1.m
...............\GCPanneal1.m
...............\GCPanneal2.m
...............\GCPgen1.m
...............\b.mat
GCP(图着色问题)

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．