Abstract
Maximum clique and independent set problems are classical NP-full optimization problems, the solutions of which are difficult to obtain from conventional methods. Hopfield network in neural network, which simulates the partial functions of a human brain through the ultra-large scale parallel computation, has been proven to have potentials in solving these problems in a reasonable period of time. The main problem of this approach is the difficulty in defining an efficient energy function and the dynamic equation of motion for the Hopfield model. In this paper, we propose solutions to this problem by solving two typical problems in the coloring of graphs, the maximum clique and independent set, through our refined Hopfield network model. Both the mathematical model and the simulation algorithm are given here. It is found that the time complexity to obtain an optimal solution can approach one order of magnitude lower than the current available solutions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, Macmillan Press Ltd., 1976, Chapter 5.
Takoda, M., Goodman, J.W., “Neural Networks for Computation Number Representations and Programming Completely,” Applied Optics, Volume 25, Number 18, 1986, pp. 3033–3046.
Fukushima K., “Neocoqnitron: a Hierarchical Neural Network Capable of Visual Pattern Recognition,” Neural Networks, Volume 1, Number 2, 1988.
Takefugi, Y., Lee, K.C., “Artificial Neural Networks for Four-Coloring Map Problems and K-Colorability Problems,” IEEE Transactions on CAS, Volume 38, Number 2, 1991, pp. 326–333.
Tank, D.W., Hopfield, J.J., “Neural Computation by Concentrating In-Formation in Time,” Proc. Natl. Acad. Sci., USA, Volume 84, 1987, pp. 1896–1900.
Dahl, E.D., “Neural Network Algorithm for an NP-Complete Problem: Map and Graph Coloring,” Proceedings of the IEEE First International Conference on Neural Networks, Volume III, June 1987, pp. 113–120.
Hopfield, J.J., “The Effectiveness of Analogue Neural Network Hardware,” Neural Networks, Volume 1, 1990, pp. 27–46.
Funaliashi, K., “On the Approximate Realization of Continuous Mappings by Neural Networks,” Neural Networks, Number 2, 1989, pp. 182–192.
Cybenko, G., “Approximation by Super-Positions of a Sigmoidal Function, Mathematics of Control, Signals and Systems,” Number 2, 1989, pp. 303–314.
Bose, N.K., Garga, A.K., “Neural Network Design Using Variously Diagrams,” IEEE Transactions on Neural Networks, Volume 4, Number 5, September 1993, pp. 778–787.
Sethi, I.K., “Entropy Nets From Decision Trees to Neural Networks,” Proceedings of IEEE, Number 78, 1990, pp. 1605–1613.
Garga, A.K., Bose, N.K., “Structure Training of Neural Networks,” Proceedings of the IEEE Intl. Conf. Neural Networks, IEEE World Congress on Computation Intelligence, Orlando, Volume 1, 1994, pp. 239–244.
Xu, J., Zhang, J.Y., Bao, Z., “Graphic Coloring Algorithms Based on Hopfield network,” Acta Electronica Sinica, 1996, Volume 24, Number 10, 1996, pp. 8.
Ramanujarn, J., Sadayappan, P., “Optimization by Neural Networks,” Proceedings of the IEEE International Conference on Neural Networks, Volume 2, 1988, pp. 325–332.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Zhang, Y., Chi, C.H. (1999). Solving maximum clique and independent set of graphs based on hopfield network. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100703
Download citation
DOI: https://doi.org/10.1007/BFb0100703
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65821-4
Online ISBN: 978-3-540-48933-7
eBook Packages: Springer Book Archive