To search, Click
below search items.


All
Published Papers Search Service

Title

An Improved Chaotic Maximum Neural Network for Maximum Clique Problem

Author

Gang Yang, Zheng Tang, Junyan Yi

Citation 
Vol. 7 No. 2 pp. 17

Abstract

We propose an improved chaotic maximum neural network to solve maximum clique problem. Through analyzing the character of maximum neural network with an added vertex in maximum clique problem, we find that the quality and size of clique solution can be modified by tuning a parameter about vertex weight. Based on the analysis, a random nonlinear selffeedback and flexible annealing strategy are embedded in maximum neural network, which makes the network more powerful to escape local minima and be independent of the initial values. The simulation in k random graph and some graphs of the DIMACS clique instances in the second DIMACS challenge shows that our improved network is superior to other algorithms in light of the solution quality and CPU time.

Keywords

Neural network, Maximum neural network, Maximum clique Problem, Annealing strategy

URL

http://paper.ijcsns.org/07_book/200702/200702A01.pdf

