arXiv Open Access 2013

A DP Approach to Hamiltonian Path Problem

Dmitriy Nuriyev

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (1)

Dmitriy Nuriyev

Format Sitasi

APA MLA BibTeX

Nuriyev, D. (2013). A DP Approach to Hamiltonian Path Problem. https://arxiv.org/abs/1301.3093

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓