title: What is the dynamic programming algorithm for finding a Hamiltonian cycle in a graph?
body: <p>What is dynamic programming algorithm for finding a Hamiltonian cycle in an undirected graph?
  I have seen somewhere that there exists an algorithm with <code>O(n.2^n)</code> time complexity.</p>