Abstract
A polynomial algorithm for solving the ''Hamiltonian circuit'' problem is presented in the paper. Computational complexity of the algorithm is equal to $O\left(n^8\log_2^2{n}\right)$ where $n$ is the cardinality of the observed graph vertex set. Thus the polynomial solvability for ${\mathcal NP}$-complete problems is proved.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献