搜索资源列表
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 se
spectrum-allocation-color-algorithm
- 频谱分配算法，采用图着色的比例公平分配算法-Spectrum allocation algorithm, using the ratio of equitable distribution graph coloring algorithm
PicColor
- 用回溯法解决图着色问题,用回溯法解决图着色问题-Use backtracking to solve graph coloring problem
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
register-allocation-algorithm
- 图着色方法图，适用于寄存器分配 采用的是经典退火算法 -Graph coloring register allocation classic annealing algorithm
tuzhuode
- 利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing method to solve the graph coloring problem, draw the appropriate graphics, better
color
- 图着色问题一个简单的C++程序，适合新手使用学习。-A simple graph coloring problem C++ procedures, suitable for beginners to use to learn.
color-problem
- 一个关于图着色问题的在matlab下的一种解法，适合新手使用学习。-A graph coloring problem on a solution in matlab for novices to use to learn.
tabucol
- 关于图着色问题中禁忌搜索算法的讲解，适合新手使用和学习-Tabu search algorithm on the graph coloring problem explanations, suitable for beginners to use and learn
NodeColoringTabu
- 在matlab下的一种图着色的禁忌算法实现，适合新手使用和学习-In matlab under a taboo graph coloring algorithm, suitable for novices to use and learn
arrangement
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 -Suppose you want to arrange a number of activities in the hall more than enough, and want
color
- 有C++上用Cplex的软件包编写的关于一个图着色的问题。-a program using Cplex on C++ platform to color a map with many constraints.
yiqun
- 蚁群优化算法最初用于解决TSP问题，经过多年的发展，已经陆续渗透到其他领域中，比如图着色问题、大规模集成电路设计、通讯网络中的路由问题以及负载平衡问题、车辆调度问题等。-Ant colony optimization algorithm for solving the TSP problem initially, after years of development, has been gradually penetrate into other areas, such as graph col
CSharp-Graphic
- 代码实现图着色算法（应用到为无线传感器网络，链路调度上）-Code implementation graph coloring algorithm (applied to the wireless sensor network, link scheduling)
Graph-Coloring(HGA)
- 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
graph-coloring
- matlab编写的图着色算法，并用智能优化算法（模拟退火）去寻找其图着色的最优解-Matlab prepared by the graph coloring algorithm, and using intelligent optimization algorithm (simulated annealing) to find the optimal solution of the coloring of the graph
simulated annealing algorithm
- 模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1
pudn_20140502184244
- 颜色敏感的图着色算法演示 拓扑相关等多个文件(Color dependent algorithm)
图论着色的相关代码分析
- 此为大四的毕业设计论文的相关代码，题目是《有关图论着色问题非算法模型的建立与设计》，代码成功率极高。且多方面对图论着色进行了分析，同时也是这份代码被评为了优秀毕业设计论文。(This is the code of graduation thesis for senior students. The topic is "the establishment and design of non algorithmic model for graph coloring problem"
graphlite
- 基于graphlite分布式图数据处理系统的图着色问题的实现(Realization of graph coloring problem based on graphlite distributed graph data processing system)