• DocumentCode
    1412115
  • Title

    Solving maximum clique problem by cellular neural network

  • Author

    Sengor, N.S. ; Yalcin, M.E. ; Cakir, Y. ; Ucer, M. ; Guzelis, C. ; Pekergin, F. ; Morgul, O.

  • Author_Institution
    Istanbul Tech. Univ., Turkey
  • Volume
    34
  • Issue
    15
  • fYear
    1998
  • fDate
    7/23/1998 12:00:00 AM
  • Firstpage
    1504
  • Lastpage
    1506
  • 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
  • Keywords
    cellular neural nets; graph theory; optimisation; NP-hard graph theoretical problem; cellular neural network; energy descent optimising dynamics; maximum clique; stable state;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19981026
  • Filename
    706252
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1412115