Coloring-Problem
于 2013-08-23 发布
文件大小:1KB
0 97
下载积分: 1
下载次数: 51
代码说明:
图着色问题(Graph Coloring Problem, GCP)又称着色问题,是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。(Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture.)
文件列表:
着色问题welsh-powell算法.m,909,2009-07-15
下载说明:请别用迅雷下载,失败请重下,重下不扣分!
发表评论