Solving maximum clique problem by cellular neural network

Files

Solving maximum clique problem by cellular neural network.pdf (427.31 KB)

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

BUIR Usage Stats
1
views
18
downloads

Citation Stats

  • Share

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.

Source Title

Electronics Letters

Publisher

The Institution of Engineering and Technology

Course

Other identifiers

Book Title

Keywords

Approximation theory, Computational complexity, Graph theory, Hopfield dynamics, Maximum clique problem, Cellular neural networks

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/25434

Published Version (Please cite this version)

https://doi.org/10.1049/el:19981026

Collections

Scholarly Publications - Electrical and Electronics Engineering

Language

English

Type

Article