Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650)
From MaRDI portal
scientific article; zbMATH DE number 6851920
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
