On the random generation and counting of matchings in dense graphs
From MaRDI portal
Publication:1129018
Recommendations
- Exact sampling from perfect matchings of dense regular bipartite graphs
- Approximating the Permanent
- Scaling matrices and counting the perfect matchings in graphs
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
- On counting perfect matchings in general graphs
Cites work
- Fast uniform generation of regular graphs
- scientific article; zbMATH DE number 1003265 (Why is no real title available?)
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Matching is as easy as matrix inversion
- Monte-Carlo approximation algorithms for enumeration problems
- Random generation of combinatorial structures from a uniform distribution
Cited in
(11)- Permanental generating functions and sequential importance sampling
- Scaling matrices and counting the perfect matchings in graphs
- Random bichromatic matchings
- A glimpse at Paul G. Spirakis
- Some upper bounds for permanents of (0, 1)-matrices
- A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
- scientific article; zbMATH DE number 1067837 (Why is no real title available?)
- scientific article; zbMATH DE number 6960780 (Why is no real title available?)
- Approximate counting of matchings in sparse uniform hypergraphs
- The distance approach to approximate combinatorial counting
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
This page was built for publication: On the random generation and counting of matchings in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129018)
