Browsing by Subject "Maximum clique problem"

Now showing 1 - 3 of 3

Open Access
An analysis of maximum clique formulations and saturated linear dynamical network
(Springer-Verlag, 1999) Şengör, N. S.; Çakır, Y.; Güzeliş, C.; Pekergin, F.; Morgül, Ö.
Several formulations and methods used in solving an NP-hard discrete optimization problem, maximum clique, are considered in a dynamical system perspective proposing continuous methods to the problem. A compact form for a saturated linear dynamical network, recently developed for obtaining approximations to maximum clique, is given so its relation to the classical gradient projection method of constrained optimization becomes more visible. Using this form, gradient-like dynamical systems as continuous methods for finding the maximum clique are discussed. To show the one to one correspondence between the stable equilibria of the saturated linear dynamical network and the minima of objective function related to the optimization problem, La Salle's invariance principle has been extended to the systems with a discontinuous right-hand side. In order to show the efficiency of the continuous methods simulation results are given comparing saturated the linear dynamical network, the continuous Hopfield network, the cellular neural networks and relaxation labelling networks. It is concluded that the quadratic programming formulation of the maximum clique problem provides a framework suitable to be incorporated with the continuous relaxation of binary optimization variables and hence allowing the use of gradient-like continuous systems which have been observed to be quite efficient for minimizing quadratic costs.
Open Access
A saturated linear dynamical network for approximating maximum clique
(Institute of Electrical and Electronics Engineers, 1999-06) Pekergin, F.; Morgül, Ö.; Güzeliş, C.
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.
Open Access
Solving maximum clique problem by cellular neural network
(The Institution of Engineering and Technology, 1998-07-23) Şengör, N. S.; Yalçın, M. E.; Çakır, Y.; Üçer, M.; Güzeliş, C.; Pekergin, F.; Morgül, Ö.
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.