Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q29302516, #quickstatements; #temporary_batch_1709545057628 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29302516 / rank | |||
Normal rank | |||
Revision as of 11:44, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem |
scientific article |
Statements
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (English)
0 references
1983
0 references
perfect matching
0 references
2-matching
0 references
Hamiltonian cycle
0 references
hypomatchable
0 references
