Maximum Cardinality Simple 2-matchings in Subcubic Graphs (Q3105789)
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 5995774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum Cardinality Simple 2-matchings in Subcubic Graphs |
scientific article; zbMATH DE number 5995774 |
Statements
Maximum Cardinality Simple 2-matchings in Subcubic Graphs (English)
0 references
9 January 2012
0 references
combinatorial optimization
0 references
matchings
0 references
traveling salesman problem
0 references
0.9078837
0 references
0.9006902
0 references
0 references
0.8948764
0 references
0.8945794
0 references
0.89131314
0 references
0.8820498
0 references
0.88190293
0 references
0.8784159
0 references
0 references
