Neural Nets WIRN VIETRI-97 pp 139-146
Sequences of Discrete Hopfield’s Networks for the Maximum Clique Problem
- Cite this paper as:
- Grossi G. (1998) Sequences of Discrete Hopfield’s Networks for the Maximum Clique Problem. In: Marinaro M., Tagliaferri R. (eds) Neural Nets WIRN VIETRI-97. Perspectives in Neural Computing. Springer, London
We propose here a neural approximation technique for the Maximum Clique problem. The core of the method consists of a sequence of Hopfield’s networks that, in polynomial time, converge to a state representing a clique for a given graph. Some experiments made on the DIMACS benchmark show that the approximated solutions found are promising. Finally, the possibility to extend this technique to other NP-hard problems and to implement it onto neural hardware are discussed.
KeywordsMaximum Clique problem constrained optimization Hopfield’s networks
Unable to display preview. Download preview PDF.