文件名称:graph-coloring
介绍说明－－下载内容均来自于网络，请自行研究使用
基于greedy DSATUR 的经典着色程序-Given a graph, vertex coloring is the assignment of colors to the vertices such that no two adjacents vertices share the same color. Vertex coloring problem is NP-hard for general graphs. However for some specific graph classes there are some positif results. For example by definition we can trivially color a bipartite graph using two colors.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
graph coloring.m