SOLVING MAXIMUM CLIQUE PROBLEM BY CELLULAR NEURAL-NETWORK

Authors
SENGOR NS YALCIN ME CAKIR Y UCER M GUZELIS C PEKERGIN F MORGUL O
Citation
Ns. Sengor et al., SOLVING MAXIMUM CLIQUE PROBLEM BY CELLULAR NEURAL-NETWORK, Electronics Letters, 34(15), 1998, pp. 1504-1506
Citations number
6
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics Letters → ACNP
ISSN journal
00135194
Volume
34
Issue
15
Year of publication
1998
Pages
1504 - 1506
Database
ISI
SICI code
0013-5194(1998)34:15<1504:SMCPBC>2.0.ZU;2-9
Abstract
An approximate solution of an NP-hard graph theoretical problem, namel y finding maximum clique, is presented using cellular neural networks. Like the existing energy descent optimising dynamics, the maximal cli ques will be the stable states of cellular neural networks. To illustr ate the performance of the method the results will be compared with th ose of continuous Hopfield dynamics.