当前位置：
首页 资源下载
搜索资源 - coloring graph matlab
搜索资源列表
-
0下载：
有关图论程序，用matlab编写的，可进行顶点染色和边染色,Procedures related to graph theory, and the preparation of the matlab can be carried out vertex coloring and edge coloring
-
-
2下载：
利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
-
-
1下载：
认知无线电网络频谱分配的颜色敏感的图着色算法,是个很经典的算法-Cognitive radio network' s spectrum allocation of color-sensitive graph coloring algorithm, the algorithm is a very classic
-
-
0下载：
这个程序实现与Matlab的优化工具箱下，用于给图进行边着色。包含了很多图论的程序，如计算最大割集、连通度、最小覆盖边数等等……
-This program is implemented with Matlab Optimization Toolbox for graph edge coloring. Contains a lot of graph theory program, such as the calculation of the maximum cut sets, connect
-
-
0下载：
matlab图论着色，内涵可以实现简单的图论着色源代码，实现计算色的多项式等功能-the matlab graph theory coloring
-
-
0下载：
一个关于图着色问题的在matlab下的一种解法，适合新手使用学习。-A graph coloring problem on a solution in matlab for novices to use to learn.
-
-
0下载：
在matlab下的一种图着色的禁忌算法实现，适合新手使用和学习-In matlab under a taboo graph coloring algorithm, suitable for novices to use and learn
-
-
0下载：
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
-
-
0下载：
模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(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
-
-
0下载：
用于D2D用户分簇的图着色，很方便使用的一个程序(D2D user clustering for the graph coloring, it is convenient to use a program)
-
-
2下载：
基于matlab的图着色程序，算法为贪心算法，将节点按照度从大到小排序，排序后先给度大的着色。(The graph coloring program based on MATLAB algorithm, greedy algorithm, the node according to the degree from large to small order, ranking after the first to a large degree of coloring.)
-
-
0下载：
Calculate and color the graph using greedy algorithm with matlab
-
