搜索资源列表
mColor
- 图论:图的M着色问题 GraphM.h GraphOpr.h mColor.cpp mColor.dsp mColor.dsw mColor.h mColor.ncb mColor.opt mColor.plg test test.gph-graph theory : Figure M Coloring GraphM.h GraphOpr.h mColor.cpp mColo r.dsp mColor.dsw mColor.h mColor.ncb m
Cognitivenetworkcoloringbasedongraphheorymodelofth
- 认知网络中基于图论着色模型的频谱分配算法的分析-Cognitive network coloring based on graph theory model of the analysis of spectrum allocation algorithm
Map
- 有关图的邻强边染色和邻点可区别染色是图论研究必然注意的内容。-Map of the adjacent strong edge coloring and adjacent vertex-distinguishing coloring is the study of graph theory is bound to pay attention to the content.
mcolor
- 图的m着色问题。 给定无向连通图G和m种不同颜色,用这些颜色为G的各顶点着色,是否有一种着色法使其中每条边两个顶点不同色。 Java实现。-Figure m-coloring problem. A given undirected graph G and m different colors, use these colors to the vertices of G, coloring, whether there is a coloring where each edge to two
CSharp-Graphic
- 代码实现图着色算法(应用到为无线传感器网络,链路调度上)-Code implementation graph coloring algorithm (applied to the wireless sensor network, link scheduling)
mdpzf84
- VB图形色彩增强程序,可以用起对图形着色,或其他图形色彩加工-VB graphics colour enhancer, can use up to the graph coloring, or other graphics color processing,
rauianraliabilitys
- VB图形色彩增强程序,可以用起对图形着色,或其他图形色彩加工,,(VB graphics colour enhancer, can use up to the graph coloring, or other graphics color processing,)
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
geos-chem
- 后处理Geos-chem的结果,画空间填色图(Postprocessing results of Geos-chem space graph coloring)
图着色算法
- 用于D2D用户分簇的图着色,很方便使用的一个程序(D2D user clustering for the graph coloring, it is convenient to use a program)
graph_coloring
- 基于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.)
CSGC图着色算法
- 针对图着色问题所用的一种算法,解决路线着色问题。(An algorithm for graph coloring is used to solve the problem of route coloring.)
图论着色CSGC
- 针对图着色问题所用的一种敏感图论算法,解决路线着色问题。(A sensitive graph theory algorithm for graph coloring problem is used to solve the problem of route coloring.)
颜色敏感图着色CSGC
- 颜色敏感的图着色频谱分配算法,解决图着色问题。(Color-sensitive graph coloring algorithm, solving graph coloring problem.)
图论着色的相关代码分析
- 此为大四的毕业设计论文的相关代码,题目是《有关图论着色问题非算法模型的建立与设计》,代码成功率极高。且多方面对图论着色进行了分析,同时也是这份代码被评为了优秀毕业设计论文。(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)
蚁群算法(路径规划程序)
- 蚁群算法是一种群智能算法,也是启发式算法。基本原理来源于自然界蚂蚁觅食的最短路径原理。蚁群算法根据模拟蚂蚁寻找食物的最短路径行为来设计的仿生算法,因此一般而言,蚁群算法用来解决最短路径问题,并真的在旅行商问题(TSP,一个寻找最短路径的问题)上取得了比较好的成效。目前,也已渐渐应用到其他领域中去,在图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类分析等方面都有所应用。(Ant colony algorithm is a population intelligent algorithm,
GreedyColoring_MATLAB
- Calculate and color the graph using greedy algorithm with matlab
启发式算法
- 利用启发式算法解决图着色问题,包括禁忌表,仇人表等一系列操作(Solving the problem of graph coloring with heuristic algorithm)
ColorGraph
- 在D2D模型中使用图着色方法进行仿真的程序(Programs that use the graph coloring method for simulation in the D2D model)