The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$

Simple item page
dc.creatorZhu, Guohun
dc.date2007-06-19
dc.date.accessioned2026-07-07T08:11:01Z
dc.date.available2026-07-07T08:11:01Z
dc.descriptionThe 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 $O(n^3)$.
dc.description6 papers
dc.identifierhttps://arxiv.org/abs/0706.2725
dc.identifierhttp://arxiv.org/abs/0706.2725
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131995
dc.subjectData Structures and Algorithms
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.titleThe Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$
dc.typetext

Files

Collections

arXiv