an:00690966
Zbl 0809.05086
Annan, J. D.
A randomised approximation algorithm for counting the number of forests in dense graphs
EN
Comb. Probab. Comput. 3, No. 3, 273-283 (1994).
00022821
1994
j
05C85 05C05 05C30 68R10 68Q25 60C05
randomised approximation algorithm; randomised approximation scheme; counting the number of forests; dense graph
A polynomial-time randomised algorithm for uniformly generating forests in a dense graph is presented. Using this, a fully polynomial randomised approximation scheme for counting the number of forests in a dense graph is created.
J.D.Annan (Oxford)