文件名称:ISP
介绍说明--下载内容均来自于网络,请自行研究使用
独立集是指图 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.)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
ISP(独立集问题)\ISPacc.m | 69 | 2007-02-03 |
ISP(独立集问题)\ISPanneal.m | 910 | 2007-02-03 |
ISP(独立集问题)\ISPgen.m | 178 | 2007-02-03 |
ISP(独立集问题)\w.mat | 288 | 2007-02-03 |
ISP(独立集问题) | 0 | 2013-07-14 |