A polynomial time algorithm for Hamilton Cycle and its proof
Lizhi Du · 2010
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.