Affordable Access

A Algorithm for the Hamilton Circuit Problem

Authors
Type
Preprint
Publication Date
Submission Date
Identifiers
arXiv ID: 1401.6423
Source
arXiv
External links

Abstract

In this paper, we introduce two new algorithm to find a Hamilton Circuit in a graph G=(V,E). One algorithm is use a multistage graph as a special NFAs to find all Hamilton Circuit in exponential time; while another is use O(|V|) variant multistage graph as a special state set NFAs to find a fuzzy data of all Hamilton Circuit in polynomial time. The fuzzy data of the data contain those data, and the fuzzy data is not empty, if and only if the data is also not empty. And, the data is also not empty if and only if there are Hamilton Circuit in the graph. And we can find a Hamilton Circuit by the fuzzy data. Our result implies NP=P.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments