Approximately counting hamilton paths and cycles in dense graphs

SIAM Journal on Computing

Volumn 27, Issue 5, 1998, Pages 1262-1272

  Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Dense; FPRAS; Hamilton cycles

Indexed keywords

EID: 4043172278     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979426112X     Document Type: Article

References (3)

1. J. D. ANNAN, A randomised approximation algorithm for counting the number of forests in dense graphs, Combin. Probab. Comput., 3 (1994), pp. 273-284.
2. B. BOLLOBÁS, Extremal Graph Theory, Academic Press, Boston, 1978.
3. G. R. BRIGHTWELL AND P. M. WINKLER, Counting linear extensions, Order, 8 (1991), pp. 225-242.