What is dynamic programming algorithm for finding a Hamiltonian cycle?

Question

What is dynamic programming algorithm for finding a Hamiltonian cycle in a undirected graph? I have seen somewhere that there exists a algorithm with O(n*2^n) time complextity

Answer 1

I can't pluck out that particular algorithm, but there is more about Hamiltonian Cycles on The Hamiltonian Page than you will likely ever need. :)

This page intends to be a comprehensive listing of papers, source code, preprints, technical reports, etc, available on the Internet about the Hamiltonian Cycle and Hamiltonian Path Problems as well as some associated problems.

Answer 2

I am interested in finding Hamiltonian cycle in given order of Markov chain which is a directed graph. Can anybody help me to find the big-o complexity of it???