Alternative Algorithms for Counting All Matchings in Graphs
暂无分享,去创建一个
[1] Steve Chien,et al. Clifford algebras and approximating the permanent , 2002, STOC '02.
[2] L BergvandenJ.,et al. Random sampling for the monomer-dimer model on a lattice. Probabilistic techniques in equilibrium and nonequilibrium statistical physics , 1999 .
[3] Alexander Barvinok,et al. New Permanent Estimators via Non-Commutative Determinants , 2000 .
[4] Mark Jerrum,et al. The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .
[5] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.
[6] Mark Jerrum. An analysis of a Monte Carlo algorithm for estimating the permanent , 1993, IPCO.
[7] A. Barvinok. Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor , 1999 .
[8] Richard J. Lipton,et al. A Monte-Carlo Algorithm for Estimating the Permanent , 1993, SIAM J. Comput..
[9] Lars Eilstrup Rasmussen,et al. Approximating the Permanent: A Simple Approach , 1994, Random Struct. Algorithms.
[10] O. J. Heilmann,et al. Theory of monomer-dimer systems , 1972 .
[11] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[12] I. Beichl,et al. Approximating the Permanent via Importance Sampling with Application to the Dimer Covering Problem , 1999 .