Şengör, N. S.Yalçın, M. E.Çakır, Y.Üçer, M.Güzeliş, C.Pekergin, F.Morgül, Ö.2016-02-082016-02-081998-07-230013-5194http://hdl.handle.net/11693/25434An 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.EnglishApproximation theoryComputational complexityGraph theoryHopfield dynamicsMaximum clique problemCellular neural networksArticle10.1049/el:19981026