Skip to main content
U.S. flag

An official website of the United States government

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 Balancing: The Monomer-Dimer Problem

Published

Author(s)

Isabel M. Beichl, Francis Sullivan

Abstract

We describe a general 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.
Citation
Stochastic Processes and Functional Analyses
Volume
238

Citation

Beichl, I. and Sullivan, F. (2004), Applications of Sinkhorn Balancing: The Monomer-Dimer Problem, Stochastic Processes and Functional Analyses (Accessed May 21, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created January 29, 2004, Updated October 12, 2021