Solving Hamilton cycle problem by using Hopfield neural network
Lu Shengxun · Journal of Zhejiang University(Science Edition) · 2010
Suppose that PN is an inscribed regular N-side polygon of a circle which has unit diameter.Each edge of a simple graph G with the side length of PN is weighed.With respect to the pair of unadjacency vertices in G,the length of the shortest path between the pair is found and then this pair with the length of the distance of two points which link a path of PN in the same length is weighed.Hence,the Hamilton cycle problem of G transforms to a traveling salesman problem to determine that whether there exists an optimal tour with the length of perimeter of PN.In order to get correct result by Hopfield neural network method,the initial states are simplified and the dynamic elimination method is used.