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.

Filename	Size	Update
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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．