- Category:
- Other systems
- Tags:
-
- File Size:
- 1kb
- Update:
- 2018-12-06
- Downloads:
- 0 Times
- Uploaded by:
- mr_xia
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 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 |
Download