Search - coloring graph problem

Search - coloring graph problem - List

[matlab] matlab_GCP DL : 0: 用matlabf编程求解通常的图着色问题,经常使用这个原理的.-Matlabf programming is usually used to solve the graph coloring problem, frequent use of this principle.
Update : 2025-02-17 Size : 3kb Publisher : 枫
[Data structs] tuzhaosewenti DL : 0: 图着色问题的回溯算法，图着色问题是一个NP-完全问题.-Graph Coloring Problem of backtracking algorithms, graph coloring problem is an NP-complete problem.
Update : 2025-02-17 Size : 1kb Publisher : 张金水
[Mathimatics-Numerical algorithms] graphics DL : 0: 图着色问题得Visual C++ 代码，可共学习算法设计的学习者参考-Graph Coloring Problem was Visual C++ Code, a total of learners learning algorithm design reference
Update : 2025-02-17 Size : 147kb Publisher : hn
[matlab] GCPanneal2 DL : 0: 图论研究中的图着色问题的matlab程序，非常好用啊！-Study of Graph Theory Graph Coloring Problem of matlab program, very easy to use ah!
Update : 2025-02-17 Size : 1kb Publisher : liu
[AI-NN-PR] simulate_anneal DL : 0: 用mathlab编写的经典的模拟退火应用程序，包括图着色问题，最大截问题等-Mathlab prepared to use the classic simulated annealing applications, including graph coloring problem, the largest cut-off problems
Update : 2025-02-17 Size : 15kb Publisher : xianyan
[Data structs] Bipartite-graph-to-determine DL : 0: 本压缩文件完整地实现了二分图判定的判定算法，代码很完整 -This compressed file a complete bipartite graph realized the judge determine the algorithm, the code is very complete
Update : 2025-02-17 Size : 1kb Publisher : 榔头
[Mathimatics-Numerical algorithms] Coloring_a_graph_using_split_decomposition DL : 0: A solution for Graph Coloring problem Coloring a graph using split decomposition
Update : 2025-02-17 Size : 58kb Publisher : Hydrae
[AI-NN-PR] color1 DL : 0: 给定无向连通图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.
Update : 2025-02-17 Size : 10kb Publisher : lirui
[Algorithm] graph DL : 0: This file includes the basic implementation of simulated annealing where it is used to optimize the graph coloring problem.
Update : 2025-02-17 Size : 28kb Publisher : nancy
[AI-NN-PR] tuzhuode DL : 0: 利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
Update : 2025-02-17 Size : 2kb Publisher : 宋聃
[Mathimatics-Numerical algorithms] graph_coloring DL : 0: this algorithm uses genetic algorithm for solve graph coloring problem
Update : 2025-02-17 Size : 2kb Publisher : salar
[AI-NN-PR] yichuan-c-chengxu DL : 1: 遗传算法解决图的着色问题，这里面都是源程序，很有用-Genetic algorithms to solve graph coloring problem, this all source code, very useful
Update : 2025-02-17 Size : 3kb Publisher : 江星
[Special Effects] M-graph-coloring-problem DL : 0: 通过鼠标绘制出该图的结构（可在菜单中设置打点和画线两种命令：当选择打点命令是，鼠标每点击一下则在屏幕上打一个点，当选择画线命令时，鼠标首先选中其中一个点，在选中另一个点时绘制出两个点之间的连线。当然也可采用其他方法完成图的绘制）。然后用不同的颜色来标识这些点，使得图中每条边连接的2个顶点着不同的颜色。在屏幕上应能显示出用不同颜色着色后的图。-Through the mouse to draw out the structure of the graph (which can be set in the menu are two RBI and drawing a line command: When you select RBI command that every click you mouse on the screen make a point, when selecting drawing a line command, the mouse first election in one point, another point is selected to draw the line between two points. of course, other methods can be used to complete mapping.) Then use different colors to identify these points so that every edge connected graph 2 vertices with different colors. On the screen should be able to display colored with different colors after the map.
Update : 2025-02-17 Size : 3.62mb Publisher : 陈言教
[GUI Develop] graph DL : 0: c code for graph coloring problem
Update : 2025-02-17 Size : 1kb Publisher : punit
[JSP/Java] Coloring DL : 0: 算法设计与分析王晓东版本采用java编写图的m着色问题完整代码-M coloring problem complete code written using java graph algorithm design and analysis Wang Xiaodong version
Update : 2025-02-17 Size : 1kb Publisher : xr0517
[Industry research] Coloring-Problem DL : 0: Cellular Learning Automata-based Graph Coloring Problem
Update : 2025-02-17 Size : 98kb Publisher : mhfff
[matlab] graph-coloring DL : 0: 基于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 classes there are some positif results. For example by definition we can trivially color a bipartite graph using two colors.
Update : 2025-02-17 Size : 1kb Publisher : joran
[matlab] Coloring-Problem DL : 0: 图着色问题（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 famous conjecture.
Update : 2025-02-17 Size : 1kb Publisher : 刘适
[Software Engineering] color-problem DL : 0: 一个关于图着色问题的在matlab下的一种解法，适合新手使用学习。-A graph coloring problem on a solution in matlab for novices to use to learn.
Update : 2025-02-17 Size : 162kb Publisher : 赵广
[AI-NN-PR] Graph-Coloring(HGA) DL : 1: 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
Update : 2025-02-17 Size : 1.16mb Publisher :

« 12 3 »