The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
Data Structures and Algorithms
2007-06-20 v1 Computational Complexity
Discrete Mathematics
Abstract
The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is .
Cite
@article{arxiv.0706.2725,
title = {The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$},
author = {Guohun Zhu},
journal= {arXiv preprint arXiv:0706.2725},
year = {2007}
}