Beichl, I.
and Sullivan, F.
(2004),
Applications of Sinkhorn Balancingto Counting Problems, Modern Analysis and Probability: Stochastic Processes and Functional Analysis, Conference ||| Marcel Dekker
(Accessed December 10, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Applications of Sinkhorn Balancingto Counting Problems
Published
Author(s)
,
Abstract
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. Applications to the dimmer covering problem and the monomer-dimer problem are detailed.Proceedings Title
Modern Analysis and Probability: Stochastic Processes and Functional Analysis, Conference ||| Marcel Dekker
Volume
238
Conference Dates
November 1, 2002
Conference Title
Lecture Notes in Pure and Applied Mathematics
Pub Type
Conferences
Keywords
algorithms, graph theory, importance sampling, Monte Carlo methods, probability, sampling methods, stochastic matrices
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 1, 2004, Updated February 17, 2017