An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs

Jinshan Zhang, Fengshan Bai. An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs. Theoretical Computer Science, 412(4-5):419-429, 2011. [doi]

Abstract

Abstract is missing.