Title :
A polynomial time algorithm for Hamilton Cycle and its proof
Author_Institution :
Coll. of Comput. Sci. & Technol., Wuhan Univ. of Sci. & Technol., Wuhan, China
Abstract :
We present a polynomial time algorithm for finding a Hamilton Cycle(Path) in an undirected graph and proves its correctness. A program is developed according to this algorithm and it works very well. This paper declares the algorithm, its proof, and the experiment data. Even only our experiment data is a breakthrough.
Keywords :
algorithm theory; graph theory; polynomials; Hamilton cycle; polynomial time algorithm; undirected graph; Algorithm design and analysis; Computational complexity; Computer science; Costs; Educational institutions; Polynomials; Sufficient conditions; Testing; Computational Complexity; Computer Algorithm; Hamilton Cycle; Hamilton Path; Polynomial Time;
Conference_Titel :
Computer Design and Applications (ICCDA), 2010 International Conference on
Conference_Location :
Qinhuangdao
Print_ISBN :
978-1-4244-7164-5
Electronic_ISBN :
978-1-4244-7164-5
DOI :
10.1109/ICCDA.2010.5540768
