论文信息 - Counting the Number of Hamilton Cycles in Random Digraphs

Counting the Number of Hamilton Cycles in Random Digraphs

We show that there exists a a fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs.

Alan M. Frieze | Stephen Suen | A. Frieze | Stephen Suen

[1] J. H. Lint. Concrete mathematics : a foundation for computer science / R.L. Graham, D.E. Knuth, O. Patashnik , 1990 .

[2] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .

[3] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..

[4] Mark Jerrum. An analysis of a Monte Carlo algorithm for estimating the permanent , 1993, IPCO.