NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

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.

PUBLICATIONS

Applications of Sinkhorn Balancingto Counting Problems

Published

Author(s)

Isabel M. Beichl, F Sullivan

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

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 October 9, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created July 1, 2004, Updated February 17, 2017
Was this page helpful?