搜索资源列表
graphtheoryprogram.rar
- 有关图论程序,用matlab编写的,可进行顶点染色和边染色,Procedures related to graph theory, and the preparation of the matlab can be carried out vertex coloring and edge coloring
Shen
- graph coloring with GA
Graphcoloring
- 采取邻接矩阵的搜索算法实现了对图的着色,是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm
Bipartite-graph-to-determine
- 本压缩文件完整地实现了二分图判定的判定算法,代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
Coloring_a_graph_using_split_decomposition
- A solution for Graph Coloring problem Coloring a graph using split decomposition
Basedonthecognitivenetworkofgraphcoloringmodelofth
- 本文研究了认知网络中基于图论着色模型的频谱分配算法。-This paper studies the cognitive network model based on graph theory spectrum allocation algorithm for coloring.
color1
- 给定无向连通图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
graph
- This file includes the basic implementation of simulated annealing where it is used to optimize the graph coloring problem.
tuzhuode
- 利用模拟退火法解决图着色问题,画出相应的图形,效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
graph_coloring
- this algorithm uses genetic algorithm for solve graph coloring problem
yichuan-c-chengxu
- 遗传算法解决图的着色问题,这里面都是源程序,很有用-Genetic algorithms to solve graph coloring problem, this all source code, very useful
M-graph-coloring-problem
- 通过鼠标绘制出该图的结构(可在菜单中设置打点和画线两种命令:当选择打点命令是,鼠标每点击一下则在屏幕上打一个点,当选择画线命令时,鼠标首先选中其中一个点,在选中另一个点时绘制出两个点之间的连线。当然也可采用其他方法完成图的绘制)。然后用不同的颜色来标识这些点,使得图中每条边连接的2个顶点着不同的颜色。在屏幕上应能显示出用不同颜色着色后的图。-Through the mouse to draw out the structure of the graph (which can be set in
PSO
- 粒子群优化算法的源程序代码 经验证是可行的-Personal collection of a directed acyclic graph support vector machine for multi-classification problems
DYNAMIK-COLORING
- Dynamic graph coloring algorithm
CSGC
- 认知无线电网络频谱分配的颜色敏感的图着色算法,是个很经典的算法-Cognitive radio network' s spectrum allocation of color-sensitive graph coloring algorithm, the algorithm is a very classic
graph
- c code for graph coloring problem
Graph-theory
- 本文档主要讲解了基于图论着色的动态频谱分配研究,可以让大家快速的学习认知无线电中的频谱分配-This document is mainly on the dynamic spectrum allocation based on graph coloring theory research, so that we can quickly learn the spectrum allocation in cognitive radio
graph-coloring
- 链接OpenGL的类库,绘制图形,并给图形着色的一个小程序-Link the OpenGL library, draw graphics, and gave a small program graph coloring
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 classe
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