Adjacency Edge Growth Algorithm for Determining Hamilton Circle of a Simple Undirected Graph
Hong Li, Xuegang Hu · Microcomputer Development · 2004
On the belief that Hamilton circle determines Hamilton graph,the paper suggests a transformation method to locate Hamilton circle in the graph,ie.Hamilton circle of the given graph is located with the approach to locating the adjacency edge growth transformation which satisfies all the vertex set in the given graph among vertex set.Hence,the adjacency edge growth transformation method AEG under Edmonds is designed to locate the adjacency edge growth transformation,and proves this algorithm can correctly determine whether Hamilton circle is in the given undirected graph and time complexity is O(n2). The paper concludes its effectiveness and practicality with the applied examples.