On the random generation and counting of matchings in dense graphs (Q1129018)
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 1190167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the random generation and counting of matchings in dense graphs |
scientific article; zbMATH DE number 1190167 |
Statements
On the random generation and counting of matchings in dense graphs (English)
0 references
13 August 1998
0 references
Markov chains
0 references
matchings
0 references
random generation
0 references
approximate counting
0 references
0.8597741723060608
0 references
0.842401921749115
0 references
0.841836154460907
0 references
0.8410768508911133
0 references
0.8383969664573669
0 references
