Description: 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm Platform: |
Size: 207872 |
Author:yangke |
Hits:
Description: 给定无向连通图G和m种不同的颜色。用这些颜色为图G的各顶点着色，每个顶点
着一种颜色。是否有一种着色法使G中每条边的2个顶点着不同颜色。这个问题是
图的m可着色判定问题。若一个图最少需要m种颜色才能使图中每条边连接的2个
顶点着不同颜色，则称这个数m为该图的色数。求一个图的色数m的问题称为图的
m可着色优化问题。
-Given an undirected connected graph G, and m kinds of different colors. With these colors for the map G, the vertex shading, each vertex
With a color. Is there a shading to G, each edge two vertices with different colors. The problem is
M can be determined graph coloring problem. If a plan requires a minimum of m kinds of color can make graph each edge connecting two
Vertices with different colors, claimed that the number of m for the chromatic number of graphs. Seeking a graph called the chromatic number of graph problems m
m can be colored optimization problem. Platform: |
Size: 10240 |
Author:lirui |
Hits:
Description: 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中，存在着大量的组合优化问题。例如，货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等，这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electronic engineering and other fields, there are a large number of combinatorial optimization problems. For example, the traveling salesman problem, the maximum cut problem ,0-1 knapsack problem, graph coloring problems, equipment problems and wiring layout problems, these problems have yet to find a polynomial time algorithm. Platform: |
Size: 185344 |
Author:张浩 |
Hits:
Description: 这个程序实现与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, connectivity, minimal covering the number of edges, etc. ... Platform: |
Size: 28672 |
Author:Kansess |
Hits:
Description: 蚁群优化算法最初用于解决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 coloring problem, VLSI design, communication network routing problems and load balancing, vehicle scheduling problems . Platform: |
Size: 2048 |
Author:天枢 |
Hits:
Description: 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 Platform: |
Size: 6144 |
Author:HMCFD |
Hits:
Search - optimization coloring graph