搜索资源列表
simulated annealing
- 模拟退火算法求解经典图论中的图着色问题的源程序-simulated annealing algorithm classic graph coloring map of the source
LectureHalls.rar
- acm算法设计—会场安排问题！ 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。) 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。,acm algorithm design- the venue arrangements! Assume it to be enough room
t
- 回溯经典-m图着色问题（和地图4色问题的区别） - train的专栏 - CSDN博客-Back classic-m graph coloring problem (and the 4-color map problem of difference)- train column- CSDN blog
map
- 实现图着色问题，也有其拓展算法及其作用 是c＋＋问题 -The realization of Graph Coloring Problem, also has its expansion algorithm and its role is to c problem
register
- 图着色寄存器分配法，基于图着色方式来解决寄存器分配问题，是编译器后端三大功能之一。-Graph Coloring Register Allocation Act
aa
- 图的着色问题，可以使用四种颜色给一个地图上的不同地方着上不同的颜色，并且不超过四种颜色。-Graph coloring problem, you can use four kinds of colors to a different places on the map with different colors, and no more than four colors.
Agraphcoloringapproachforimagesegmentation
- 一种新型而又很有前景的图像分割的算法，多交流。-A graph coloring approach for image segmentation
coulor
- 用我们所写的C++程序去实现我们想要得到的图形的染色-With our C++ program written to achieve what we want the graph coloring
map
- 使用vc++实现算法分析与设计中n图着色的的实现，使用递归算法，比较简单-Using vc++ algorithm analysis and design of the implementation of n graph coloring, using a recursive algorithm, a relatively simple
1112333
- 量子遗传算法应用于物理频谱分析，结果表明基于量子遗传算法的频谱分配算法性能明显优于颜色敏感图论着色算法-Quantum genetic algorithm is applied to the physical spectrum analysis, the results show that genetic algorithm based on quantum of spectrum allocation algorithm is superior to color-sensitive color
Basedonthecognitivenetworkofgraphcoloringmodelofth
- 本文研究了认知网络中基于图论着色模型的频谱分配算法。-This paper studies the cognitive network model based on graph theory spectrum allocation algorithm for coloring.
huichanganpaiwenti
- 会场安排问题 Descr iption 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的 贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个 顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小 会场数。) 编程任务： 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。 Input 由文件input.txt给出输入数据。第一行有1 个正整数k，表示有k个
programme
- 标准基类程序，可以在进行图着色问题时，作为基类程序应用-Standard-based class program that can progress graph coloring problem, as the base class procedure applied
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
Coloring-Problem
- Cellular Learning Automata-based Graph Coloring Problem
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
graph-vertex-coloring
- 简单图的染色数尽可能少的顶点染色方案，给定一个简单图，输入邻接矩阵就可以到最少颜色数和染色方案-Simple graph coloring number as little as possible vertex coloring scheme, given a simple graph, adjacency matrix input can to the minimum number of colors and color schemes
grgphics-graph
- VB图形色彩增强程序,可以用起对图形着色,或其他图形色彩加工,,(VB graphics colour enhancer, can use up to the graph coloring, or other graphics color processing,)