A determinant-based algorithm for counting perfect matchings in a general graph (Q5501332)
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 6469214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A determinant-based algorithm for counting perfect matchings in a general graph |
scientific article; zbMATH DE number 6469214 |
Statements
3 August 2015
0 references
0.8690101504325867
0 references
0.8494859933853149
0 references
0.8438367247581482
0 references
