ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

A Polynomial Time Algorithm for Hamilton Cycle?

Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 11)

Publication Date:

Authors : ; ;

Page : 21-24

Keywords : Hamilton cycle; NP completeness; Strong NP complete; polynomial time; random algorithm;

Source : Downloadexternal Find it from : Google Scholarexternal


This paper has a random polynomial time algorithm for finding Hamilton Cycle. As Hamilton Cycle problem is a strong NP complete problem and there is no polynomial time algorithm has been developed till now with proof. I have tried to prove it theoretically.

Last modified: 2014-11-03 22:39:48