Solving maximum clique problem by cellular neural network
Date
1998-07-23
Authors
Şengör, N. S.
Yalçın, M. E.
Çakır, Y.
Üçer, M.
Güzeliş, C.
Pekergin, F.
Morgül, Ö.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Electronics Letters
Print ISSN
0013-5194
Electronic ISSN
Publisher
The Institution of Engineering and Technology
Volume
34
Issue
15
Pages
1504 - 1506
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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.