Approximately counting Hamilton cycles in dense graphs

Authors:
Martin Dyer;Alan Frieze;Mark Jerrum
Affiliations:
School of Computer Studies, University of Leeds, Leeds LS2 9JT, UK;Mathematics Department, Carnegie Mellon University, Pittsburgh PA;Department of Computer Science, University of Edinburgh, The King's Buildings, Edinburgh, EH9 3JZ, UK
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Citing 10
Cited 2

How hard is it to marry at random? (On the approximation of the permanent)

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the complexity of computing the volume of a polyhedron

SIAM Journal on Computing
Approximating the permanent

SIAM Journal on Computing
Fast uniform generation of regular graphs

Theoretical Computer Science
Concrete mathematics: a foundation for computer science

Concrete mathematics: a foundation for computer science
A random polynomial-time algorithm for approximating the volume of convex bodies

Journal of the ACM (JACM)
On the number of Eularian orientations of a graph

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation algorithms for the Ising model

SIAM Journal on Computing
On the Difference Between One and Many (Preliminary Version)

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Extremal Graph Theory

Extremal Graph Theory

An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs

Theoretical Computer Science
Computing and counting longest paths on circular-arc graphs in polynomial time

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract