Heuristics to Find Maximum Independent Set: An Overview

The maximum independent set problem (MISP) is to find the largest subset of vertices of a graph such that none of these vertices are connected by an edge (i.e., all vertices are independent of each other). It has many real life applications. In solving MISP, especially where the complexity of the graph increases, exact methods become impractical or sometimes become too slow to provide a solution. In those cases, the evolutionary heuristics are being successfully used by many researchers. In this paper, a critical review of different existing approaches in evolutionary methods to solve MISP, has been made. Later, some of the future scopes are being presented.

[1]  Alain Hertz,et al.  STABULUS: A technique for finding stable sets in large graphs with tabu search , 1989, Computing.

[2]  Zhiqiang Chen,et al.  Finding a Near-Maximum Independent Set of a Circle Graph by Using Genetic Algorithm with Conditional Genetic Operators , 2008, 2008 Fourth International Conference on Natural Computation.

[3]  Charu C. Aggarwal,et al.  Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..

[4]  Youmei Li,et al.  An ant colony optimization heuristic for solving maximum independent set problems , 2003, Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Hua Wang,et al.  An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem , 2006, ICIC.

[7]  A. Taranenko,et al.  An elitist genetic algorithm for the maximum independent set problem , 2001, Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001..

[8]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[9]  Xingzhao Liu,et al.  A Genetic Approach for Maximum Independent Set Problems (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems) , 1997 .

[10]  L. Burke.  A neural design for solution of the maximal independent set problem , 1992 .

[11]  Jiahai Wang,et al.  An improved transiently chaotic neural network for the maximum independent set problem , 2004, Int. J. Neural Syst..

[12]  Sergiy Butenko,et al.  Maximum independent set and related problems, with applications , 2003 .

[13]  Valmir Carneiro Barbosa,et al.  A Novel Evolutionary Formulation of the Maximum Independent Set Problem , 2003, J. Comb. Optim..

[14]  Abbas Mehrabi,et al.  A New Hybrid Genetic Algorithm for Maximum Independent Set Problem , 2016, ICSOFT.

[15]  Thomas Bäck,et al.  An evolutionary heuristic for the maximum independent set problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[16]  Yoshiyasu Takefuji,et al.  Parallel algorithms for finding a near-maximum independent set of a circle graph , 1990, IEEE Trans. Neural Networks.

[17]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[18]  Madhumangal Pal,et al.  Genetic algorithmic approach to find the maximum weight independent set of a graph , 2007 .

[19]  Alain Hertz,et al.  Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph , 1990, Comput. Oper. Res..

[20]  Zbigniew Michalewicz,et al.  An ant system for the maximum independent set problem , 2001 .