On counting perfect matchings in general graphs (Q2294743)
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 7166246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On counting perfect matchings in general graphs |
scientific article; zbMATH DE number 7166246 |
Statements
On counting perfect matchings in general graphs (English)
0 references
12 February 2020
0 references
Gallai-Edmonds decomposition of a graph
0 references
Markov chain
0 references
0.95867395
0 references
0 references
0.94313407
0 references
0.93978286
0 references
0.9358907
0 references
0.93535304
0 references
0.9333894
0 references
