Publication:3128893
From MaRDI portal
zbMath0867.05030MaRDI QIDQ3128893
Martin Dyer, Mark R. Jerrum, Alan M. Frieze
Publication date: 23 April 1997
68R10: Graph theory (including graph drawing) in computer science
05C30: Enumeration in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C45: Eulerian and Hamiltonian graphs
Related Items
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case, An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs, On the random generation and counting of matchings in dense graphs, An analysis of Monte Carlo algorithm for estimating the permanent