A parallel neural network computing for the maximum clique problem

Kuo Chun Lee, Nobuo Funabiki, Y. B. Cho, Yoshiyasu Takefuji

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

A novel computational model for large-scale maximum clique problems is proposed and tested. The maximum clique problem is first formulated as an unconstrained quadratic zero-one programming and it is solved by minimizing the weight summation over the same partition in a newly constructed graph. The proposed maximum neural network has the following advantages: (1) coefficient-parameter tuning in the motion equation is not required in the maximum neural network while the conventional neural networks suffer from it; (2) the equilibrium state of the maximum neural network is clearly defined in order to terminate the algorithm, while the existing neural networks do not have the clear definition; and (3) the maximum neural network always allows the state of the system to converge to the feasible solution, while the existing neural networks cannot guarantee it. The proposed parallel algorithm for large-size problems outperforms the best known algorithms in terms of computation time with much the same solution quality where the conventional branch-and-bound method cannot be used due to the exponentially increasing computation time.

Original languageEnglish
Title of host publication91 IEEE Int Jt Conf Neural Networks IJCNN 91
PublisherPubl by IEEE
Pages905-910
Number of pages6
ISBN (Print)0780302273
Publication statusPublished - 1991 Dec 1
Externally publishedYes
Event1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 - Singapore, Singapore
Duration: 1991 Nov 181991 Nov 21

Publication series

Name91 IEEE Int Jt Conf Neural Networks IJCNN 91

Other

Other1991 IEEE International Joint Conference on Neural Networks - IJCNN '91
CitySingapore, Singapore
Period91/11/1891/11/21

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A parallel neural network computing for the maximum clique problem'. Together they form a unique fingerprint.

  • Cite this

    Lee, K. C., Funabiki, N., Cho, Y. B., & Takefuji, Y. (1991). A parallel neural network computing for the maximum clique problem. In 91 IEEE Int Jt Conf Neural Networks IJCNN 91 (pp. 905-910). (91 IEEE Int Jt Conf Neural Networks IJCNN 91). Publ by IEEE.