Efficiently approximating max-clique in a Hopfield-style network
Arun Jagota · 2003
The author approximates max-clique in a special case of the Hopfield network whose stable states are maximal cliques. Several energy-descent optimizing dynamics, both discrete and continuous, are presented. One of these emulates, as a special case, two well known greedy algorithms for approximating MAX-CLIQUE. Detailed empirical comparisons of random graphs are reported. Mean-field annealing, an efficient approximation to simulated annealing, is judged to be the most effective.>