A saturated linear dynamical network for approximating maximum clique

Date

1999-06

Authors

Pekergin, F.
Morgül, Ö.
Güzeliş, C.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
3
views
21
downloads

Citation Stats

Series

Abstract

We use a saturated linear gradient dynamical network for finding an approximate solution to the maximum clique problem. We show that for almost all initial conditions, any solution of the network defined on a closed hypercube reaches one of the vertices of the hypercube, and any such vertex corresponds to a maximal clique. We examine the performance of the method on a set of random graphs and compare the results with those of some existing methods. The proposed model presents a simple continuous, yet powerful, solution in approximating maximum clique, which may outperform many relatively complex methods, e.g., Hopfield-type neural network based methods and conventional heuristics.

Source Title

IEEE Transactions on Circuits and Systems I : Fundamental Theory and Applications

Publisher

Institute of Electrical and Electronics Engineers

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English