4 citations · 5 across the 10 of their papers we have counts for
1 paper · 1 filter
Jinshan Zhang
We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is succes…