A Polynomial Time Algorithm for the Hamilton Circuit Problem

📝 Original Info

• Title: A Polynomial Time Algorithm for the Hamilton Circuit Problem
• ArXiv ID: 1305.5976
• Date: 2014-02-07
• Authors: Researchers from original ArXiv paper

📝 Abstract

In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.

💡 Deep Analysis

Deep Dive into A Polynomial Time Algorithm for the Hamilton Circuit Problem.

In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem. To solve the MSP problem, we propose a polynomial algorithm and prove its NP-completeness. Our result implies NP=P.

📄 Full Content

Reference