Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650)
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: Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs |
scientific article; zbMATH DE number 6851920
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs |
scientific article; zbMATH DE number 6851920 |
Statements
21 March 2018
0 references
optimization algorithms
0 references
matching theory
0 references
traveling salesman problem
0 references
restricted 2-matchings
0 references
Hamilton-laceable graphs
0 references
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (English)
0 references
1.0000001
0 references
0.91655815
0 references
0.8988214
0 references
0.8984001
0 references
0.8976609
0 references
0.89218694
0 references
0.88718855
0 references
0.88519216
0 references
