Combinatorics and Graph Theory

   

Resolving the Decision Version of the Directed Hamiltonian Path (Cycle) Problem Under Two Special Conditions by Method of Matrix Determinant: an Overview

Authors: Okunoye Babatunde O.

In computational complexity, the Decision version of the Directed Hamiltonian Path Problem is known to be NP-complete (Nondeterministic-Polynomial complete). There are no known efficient algorithms for its resolution in Polynomial time. In three papers, the author shows that this problem can be resolved in Polynomial time under two special conditions relating to the determinant of a matrix: the absence of zero rows (columns) and similar rows (columns). In this paper, the author gives a brief overview of the proposed solution and the P vs NP problem.

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2013-04-02 01:26:20

Unique-IP document downloads: 189 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus