Solving maximum clique problem by cellular neural network


Sengor N. S., Yalcin M. E., CAKIR Y., UCER M., GUZELIS C., PEKERGIN F., ...Daha Fazla

ELECTRONICS LETTERS, cilt.34, sa.15, ss.1504-1506, 1998 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 34 Sayı: 15
  • Basım Tarihi: 1998
  • Doi Numarası: 10.1049/el:19981026
  • Dergi Adı: ELECTRONICS LETTERS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1504-1506
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

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.