Description: 用matlab编程求解图论中独立集问题(ISP),程序简单明了,希望大家能提出更进一步的改进意见.-Matlab programming using graph theory for solving Independent Set Problem (ISP), the procedure is simple and hope that we can introduce a further improvement. Platform: |
Size: 1024 |
Author:枫 |
Hits:
Description: 图论研究中的独立集问题的matlab程序，实践证明很好用啊！-Graph Theory Research the issue of an independent set of matlab procedures, practice has proved very good with ah! Platform: |
Size: 1024 |
Author:liu |
Hits:
Description: The xgraph program draws a graph on an X display given data read from
either data fi les or from standard input if no fi les are specifi ed. It can display
up to 64 independent data sets using diff erent colors and/or line styles for
each set. It annotates the graph with a title, axis labels, grid lines or tick
marks, grid labels, and a legend. Platform: |
Size: 53248 |
Author:Mihock |
Hits:
Description: 图论的算法书籍，书中包含许多经典的例子，入门用。
章节：1基本概念 2最短路径 3最小生成树 4图的连通性 5支配集与独立集 6网络流 7匹配 8着色 9可行遍性-Graph theory, algorithms books, the book contains many classic examples of entry to use. Chapters: a basic concept of two shortest path minimal spanning tree 4 Figure 3 connectivity of five dominating set and independent set of six matching network flow 7 of 8 coloring 9 viable over the Platform: |
Size: 4300800 |
Author:wlx |
Hits:
Description: 算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。
无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的
子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirected graph of maximum clique and maximum independent set problem can be regarded as the vertex set V G is a subset selection problem can be backtracking in O (n* (2 ^ n)) time to solve. Platform: |
Size: 1024 |
Author:草拟嘛 |
Hits:
Description: 着色问题，是最著名的NP-完全问题之一。
给定一个无向图G＝（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the set of edges, the graph coloring problem is the V-K colors into groups, each forming an independent set, that none of them adjacent vertices. Its optimized version is to obtain the minimum value of K. Platform: |
Size: 2048 |
Author:Chanel |
Hits:
Description: An implementation of Genetic Algorithm using java. This specifically for Independent set in graph. But you can use it for your own usage by changing fitnessCalc class.-An implementation of Genetic Algorithm using java. This is specifically for Independent set in graph. But you can use it for your own usage by changing fitnessCalc class. Platform: |
Size: 58368 |
Author:elaheh |
Hits:
Description: 独立集是指图 G 中两两互不相邻的顶点构成的集合。任意有关图中团的性质都能很自然的转述成独立集的性质。一般而言，寻找图的最大团是 NP 困难的，从而寻找图的最大独立集也是 NP 困难的。用模拟退火算法找出图的最大独立集。(Independent set is a set of vertices in graph G that are not adjacent to each other. The properties of cliques in any graph can be naturally expressed as the properties of independent sets. Generally speaking, it is NP-hard to find the maximum clique of a graph, so it is NP-hard to find the maximum independent set of a graph. Simulated annealing algorithm is used to find the maximum independent set of graphs.) Platform: |
Size: 1024 |
Author:mr_xia |
Hits:
Search - independent set graph