An efficient approximation algorithm for finding a maximum clique using Hopfield network learning.
In this article, we present a solution to the maximum clique problem using a gradient-ascent learning algorithm of the Hopfield neural network. This method provides a near-optimum parallel algorithm for finding a maximum clique. To do this, we use the Hopfield neural network to generate a near-maximum clique and then modify weights in a gradient-ascent direction to allow the network to escape from the state of near-maximum clique to maximum clique or better. The proposed parallel algorithm is tested on two types of random graphs and some benchmark graphs from the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). The simulation results show that the proposed learning algorithm can find good solutions in reasonable computation time.
Wang
Rong Long
RL
Faculty of Engineering, Toyama University, Toyama-shi, Japan 930-8555. wangrl@hi.iis.toyama-u.ac.jp
Tang
Zheng
Z
Cao
Qi Ping
QP
D000465:Algorithms; D007858:Learning / Q000502:physiology*; D016571:Neural Networks, Computer