An application of cellular neural network maximum clique problem

Abstract

An approximate solution to an NP-hard discrete optimization problem, namely finding maximum clique, is given using cellular neural networks. Even though the problem is defined by discrete variables, a continuous cellular network is used. The maximal cliques are the stable states of the cellular neural networks. To illustrate the performance of the method, the results are compared with some existing models as saturated linear dynamical network continuous Hopfield dynamics.