Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7403396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs |
scientific article; zbMATH DE number 7403396 |
Statements
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (English)
0 references
29 September 2021
0 references
asymptotic normality
0 references
distributional recursion
0 references
importance sampling
0 references
Monte Carlo methods
0 references
perfect matchings
0 references
randomized algorithms
0 references
0 references
0 references
0.9118072390556335
0 references
0.9058368802070618
0 references
0.8419492244720459
0 references
0.8410768508911133
0 references
0.8356706500053406
0 references
