The NPO-completeness of the longest Hamiltonian cycle problem (Q293205)
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 NPO-completeness of the longest Hamiltonian cycle problem |
scientific article; zbMATH DE number 6590675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The NPO-completeness of the longest Hamiltonian cycle problem |
scientific article; zbMATH DE number 6590675 |
Statements
The NPO-completeness of the longest Hamiltonian cycle problem (English)
0 references
9 June 2016
0 references
computational complexity
0 references
NPO-complete
0 references
strict reduction
0 references
longest Hamiltonian cycle problem
0 references
longest traveling salesperson problem
0 references
0.88538647
0 references
0.88176715
0 references
0.87778664
0 references
0 references
0 references
