Solving Max-Clique Using Cellular Neural Network

In this paper, we present an artificial life method of the cellular neural network for max-clique problem. The method is intended to provide an optimum parallel algorithm for solving the max-clique problem. To do this we use the cellular neural network to get a maximum clique. Some of the instances are simulated to verify the proposed method with the simulation results showing that the solution quality is superior to that of best existing parallel algorithm. We also test the learning method on total coloring problem.