scientific article
From MaRDI portal
zbMath0867.05030MaRDI QIDQ3128893
Martin Dyer, Mark R. Jerrum, Alan M. Frieze
Publication date: 23 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
On the random generation and counting of matchings in dense graphs, 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, Computing and counting longest paths on circular-arc graphs in polynomial time, An analysis of Monte Carlo algorithm for estimating the permanent
