Solving maximum clique problem by cellular neural network
Şengör, N. S.
Yalçın, M. E.
The Institution of Engineering and Technology
1504 - 1506
Item Usage Stats
An approximate solution of an NP-hard graph theoretical problem, namely finding maximum clique, is presented using cellular neural networks. Like the existing energy descent optimising dynamics, the maximal cliques will be the stable states of cellular neural networks. To illustrate the performance of the method, the results will be compared with those of continuous Hopfield dynamics.
Maximum clique problem
Cellular neural networks