A Polynomial Time Algorithm for Hamilton Cycle?

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

Publication Date: 2014-11-30

Authors : Mamta; Siddhartha Sankar Biswas;

Page : 21-24

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

Source : Download Find it from : Google Scholar

Abstract

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.

Main Menu

Searching By

PARTNERS

A Polynomial Time Algorithm for Hamilton Cycle?

Abstract

Advertisement