The cost of perfection for matchings in graphs (Q299061)
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: The cost of perfection for matchings in graphs |
scientific article; zbMATH DE number 6596250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cost of perfection for matchings in graphs |
scientific article; zbMATH DE number 6596250 |
Statements
The cost of perfection for matchings in graphs (English)
0 references
22 June 2016
0 references
triangle meshes
0 references
perfect matchings
0 references
cubic graphs
0 references
regular bipartite graphs
0 references
0 references
0.8203738927841187
0 references
0.7973656058311462
0 references
0.7910696268081665
0 references
0.7902387380599976
0 references
