文件名称:GCP
介绍说明--下载内容来自于网络,使用问题请自行百度
着色问题,是最著名的NP-完全问题之一。
给定一个无向图G=(V, E),其中V为顶点集合,E为边集合,图着色问题即为将V分为K个颜色组,每个组形成一个独立集,即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-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.
给定一个无向图G=(V, E),其中V为顶点集合,E为边集合,图着色问题即为将V分为K个颜色组,每个组形成一个独立集,即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-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
GCP(图着色问题)/GCPanneal1.m
GCP(图着色问题)/GCPanneal2.m
GCP(图着色问题)/GCPgen1.m
GCP(图着色问题)/b.mat
GCP(图着色问题)
GCP(图着色问题)/GCPanneal1.m
GCP(图着色问题)/GCPanneal2.m
GCP(图着色问题)/GCPgen1.m
GCP(图着色问题)/b.mat
GCP(图着色问题)
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.