<p>A clique in a graph is a set of vertices that are all connected to each</p><p>other. A maximum clique is a clique of maximum size. A graph may have</p><p>more than one maximum cliques. The problem of finding a maximum</p><p>clique is a strongly hard NP-hard problem. It is not possible to find an</p><p>approximation algorithm which finds a maximum clique that is a constant</p><p>factor of the optimum solution. In this work, we present a genetic algorithm</p><p>for the maximum clique problem that is able to find optimum or</p><p>close to optimum solutions to most DIMACS graphs. The genetic algorithm</p><p>uses new crossover mechanisms which are able to find reasonably</p><p>good cliques which can then be used in other applications downstream.</p><p>We also provide C++ code for our algorithm. Results show that our algorithm</p><p>is able to find maximum cliques for most DIMACS instances, and</p><p>if not, close to optimum solutions for the other instances.</p>
Next Generation Genetic Algorithm for Maximum Clique Problem
