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]

Authors

Jinshan Zhang

This author has not been identified. Look up 'Jinshan Zhang' in Google

Fengshan Bai

This author has not been identified. Look up 'Fengshan Bai' in Google