July 1, 2004
Author(s)
Isabel M. Beichl, F Sullivan
We describe a gneral Monte Carlo technique based on work of Knuth for estimating the size of trees in backtrack algorithms. This method, based on importance sampling, is used to estimate the number of partial and complete matchings in a bipartite graph