Solving maximum clique problem by cellular neural network

N. S. Şengör; M. E. Yalçin; Y. Çakir; M. Üçer; C. Güzeliş; F. Pekergin; Ö Morgül

doi:10.1049/el:19981026

Solving maximum clique problem by cellular neural network

N. S. Şengör^*, M. E. Yalçin, Y. Çakir, M. Üçer, C. Güzeliş, F. Pekergin, Ö Morgül

^*Corresponding author for this work

Department of Electronics and Communication Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1504-1506
Number of pages	3
Journal	Electronics Letters
Volume	34
Issue number	15
DOIs	https://doi.org/10.1049/el:19981026
Publication status	Published - 23 Jul 1998

Access to Document

10.1049/el:19981026

Cite this

@article{a7a115a6e42c46198e995c678ac11320,

title = "Solving maximum clique problem by cellular neural network",

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.",

author = "{\c S}eng{\"o}r, {N. S.} and Yal{\c c}in, {M. E.} and Y. {\c C}akir and M. {\"U}{\c c}er and C. G{\"u}zeli{\c s} and F. Pekergin and {\"O} Morg{\"u}l",

year = "1998",

month = jul,

day = "23",

doi = "10.1049/el:19981026",

language = "English",

volume = "34",

pages = "1504--1506",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "15",

}

TY - JOUR

T1 - Solving maximum clique problem by cellular neural network

AU - Şengör, N. S.

AU - Yalçin, M. E.

AU - Çakir, Y.

AU - Üçer, M.

AU - Güzeliş, C.

AU - Pekergin, F.

AU - Morgül, Ö

PY - 1998/7/23

Y1 - 1998/7/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032118449&partnerID=8YFLogxK

U2 - 10.1049/el:19981026

DO - 10.1049/el:19981026

M3 - Article

AN - SCOPUS:0032118449

SN - 0013-5194

VL - 34

SP - 1504

EP - 1506

JO - Electronics Letters

JF - Electronics Letters

IS - 15

ER -

Solving maximum clique problem by cellular neural network

Abstract

Access to Document

Other files and links

Fingerprint

Cite this