A Polynomial Time Algorithm for the Hamilton Circuit Problem
Data Structures and Algorithms
2014-02-07 v1
Abstract
In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.
Cite
@article{arxiv.1305.5976,
title = {A Polynomial Time Algorithm for the Hamilton Circuit Problem},
author = {Xinwen Jiang},
journal= {arXiv preprint arXiv:1305.5976},
year = {2014}
}