Login / Signup
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs.
Jinshan Zhang
Fengshan Bai
Published in:
Theor. Comput. Sci. (2011)
Keyphrases
</>
randomized approximation
real time
maximum number
neural network
computer vision
memory requirements
fixed number
image processing
website
similarity measure
computational complexity
artificial neural networks
small number
directed graph