Counting matchings with \(k\) unmatched vertices in planar graphs (Q4606302)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting matchings with k unmatched vertices in planar graphs |
scientific article; zbMATH DE number 6846404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting matchings with \(k\) unmatched vertices in planar graphs |
scientific article; zbMATH DE number 6846404 |
Statements
2 March 2018
0 references
counting complexity
0 references
parameterized complexity
0 references
matchings
0 references
planar graphs
0 references
0.7932565212249756
0 references
0.7870683670043945
0 references
0.7819864153862
0 references
0.7788600921630859
0 references
0.7542938590049744
0 references
