文件名称:Coloring-Problem
介绍说明--下载内容均来自于网络,请自行研究使用
图着色问题(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