Abstract
For solving the map-coloring problems, this paper presents an energy function, a more effective dynamic equation and a more simple convergence condition. For the first time we study the map-coloring problems in the way of connecting discrete Hopfield neural network with the orthogonal optimisation, and as a practical example, a color map of China is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. D. Dahl, Proc. First Int. Conf. on Neural Networks, Vol. III, 1987, pp. 113–120.
Y. Takefuji and K. C. Lee, “Artificial Neural Networks for Four-coloring Map Problems and K-colorability Problems”,IEEE Trans. on CAS,CAS-38 (1991) 3, 326–333.
Yu Daoheng, Jia Jiyou, A Neural Network Algorithm with the Optimized Parameters and Used to Solve the TSP, CCNN-91, Nanjing, pp. 741–744.
Author information
Authors and Affiliations
About this article
Cite this article
Daoheng, Y., Jiyou, J. Applying oonn to solve map-coloring problem. J. of Electron.(China) 10, 9–14 (1993). https://doi.org/10.1007/BF02778756
Issue Date:
DOI: https://doi.org/10.1007/BF02778756