A DP Approach to Hamiltonian Path Problem
Data Structures and Algorithms
2013-01-16 v2
Abstract
A Dynamic Programming based polynomial worst case time and space algorithm is described for computing Hamiltonian Path of a directed graph. Complexity constructive proofs along with a tested C++ implementation are provided as well. The result is obtained via the use of original colored hypergraph structures in order to maintain and update the necessary DP states.
Cite
@article{arxiv.1301.3093,
title = {A DP Approach to Hamiltonian Path Problem},
author = {Dmitriy Nuriyev},
journal= {arXiv preprint arXiv:1301.3093},
year = {2013}
}