搜索资源列表
-
0下载：
本压缩文件完整地实现了二分图判定的判定算法，代码很完整
-This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
-
-
0下载：
A solution for Graph Coloring problem
Coloring a graph using split decomposition
-
-
0下载：
给定无向连通图G和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点
着一种颜色。是否有一种着色法使G中每条边的2个顶点着不同颜色。这个问题是
图的m可着色判定问题。若一个图最少需要m种颜色才能使图中每条边连接的2个
顶点着不同颜色，则称这个数m为该图的色数。求一个图的色数m的问题称为图的
m可着色优化问题。
-Given an undirected connected graph G, and m kinds of different colors. With thes
-
-
0下载：
This file includes the basic implementation of simulated annealing where it is used to optimize the graph coloring problem.
-
-
0下载：
标准基类程序，可以在进行图着色问题时，作为基类程序应用-Standard-based class program that can progress graph coloring problem, as the base class procedure applied
-
-
2下载：
利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
-
-
0下载：
this algorithm uses genetic algorithm for solve graph coloring problem
-
-
0下载：
遗传算法解决图的着色问题，这里面都是源程序，很有用-Genetic algorithms to solve graph coloring problem, this all source code, very useful
-
-
0下载：
基于蚁群算法的图的着色问题的研究，毕业论文做的，还是挺好用的-Ant colony algorithm based on graph coloring problem of the studyThesis done, or very good use
-
-
0下载：
图的着色问题的c++实现，实现平台visual studio 2008-Graph coloring problem c++, platform Visual Studio 2008
-
-
0下载：
假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数-Enough to assume that many of the arrangements for the venue where a number of activities, and want to use the venue as small as
-
-
0下载：
Solution of 3 graph coloring problem. Uses C/C++ programming language.
-
-
0下载：
This Code solve the graph coloring problem by genetic algorithm.
-
-
0下载：
着色问题，是最著名的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 se
-
-
1下载：
基于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 classe
-
-
0下载：
图着色问题（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
-
-
1下载：
利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing method to solve the graph coloring problem, draw the appropriate graphics, better
-
-
0下载：
假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。）
对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。
-Suppose you want to arrange a number of activities in the hall more than enough, and want
-
-
0下载：
利用python采用着色问题解决算法解决排考场安排问题-Use python algorithm to solve the problem of Examination arrangements using Graph Coloring Problem Methods
-
-
0下载：
基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
-
