Title :
Improvement of the Optimal Hamilton Circuit for Undirected Complete Graph
Author :
Liu, Hua ; Zou, Huilai ; Zhong, Lili ; Wang, Chaonan ; Qu, Youtian
Author_Institution :
Coll. of Math. Phys. & Inf. Eng., Zhejiang Normal Univ., Jinhua, China
fDate :
June 29 2010-July 1 2010
Abstract :
Based on the Nearest Neighbor Algorithm, this paper introduces the Algorithm of Gradually Convergent and the Cross-wire Cutting, which according to gradually convergence of the path-changing and the principle of minimum path length variation respectively. Both of them optimize the algorithm of Optimal Hamilton Circuit in undirected complete graphs, comparing three aspects of accuracy, stability and running speed. Finally, we can know the preponderance and inferior of these algorithms through synthesizing.
Keywords :
convergence; graph theory; optimisation; cross wire cutting algorithm; gradually convergent algorithm; minimum path length variation; nearest neighbor algorithm; optimal Hamilton circuit; undirected complete graph; Accuracy; Algorithm design and analysis; Approximation algorithms; Circuit stability; Complexity theory; Nearest neighbor searches; Stability analysis; Cross-wire Cutting Algorithm; Gradually Convergent Algorithm; Nearest Neighbor Algorithm; Optimal Hamilton Circuit; undirected complete graph;
Conference_Titel :
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location :
Bradford
Print_ISBN :
978-1-4244-7547-6
DOI :
10.1109/CIT.2010.363
