Hopfield-type Neural Network For Solving "Four-Coloring Map Problems
Z Xinjian · Or Transactions · 1999
In this paper, we discussed the iteration algorithm of Hopfield-type Neural Network with which the Energy Function is always guaranteed to monotonically decrease; Pointed out the error in the proof and the drawbacks of the algorithm in cite [12], and analysed the reason; Settled the difficult problem of Neural Networks for solving optimization problem with negative feedback, impproved the algorithm in cite [12]; using our method, we can successfully dye 4 different colors for every map such that any adjecnt countries dying different colors; moreover , we can solving K-colorability problem respectivly.