Now showing items 1-3 of 3

    • An analysis of maximum clique formulations and saturated linear dynamical network 

      Şengör, N. S.; Çakır, Y.; Güzeliş, C.; Pekergin, F.; Morgül, Ö. (Springer-Verlag, 1999)
      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 ...
    • A saturated linear dynamical network for approximating maximum clique 

      Pekergin, F.; Morgül, Ö.; Güzeliş, C. (Institute of Electrical and Electronics Engineers, 1999-06)
      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 ...
    • Solving maximum clique problem by cellular neural network 

      Şengör, N. S.; Yalçın, M. E.; Çakır, Y.; Üçer, M.; Güzeliş, C.; Pekergin, F.; Morgül, Ö. (The Institution of Engineering and Technology, 1998-07-23)
      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 ...