A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098)
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: A new heuristic for detecting non-Hamiltonicity in cubic graphs |
scientific article; zbMATH DE number 6654057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new heuristic for detecting non-Hamiltonicity in cubic graphs |
scientific article; zbMATH DE number 6654057 |
Statements
A new heuristic for detecting non-Hamiltonicity in cubic graphs (English)
0 references
17 November 2016
0 references
Hamiltonian cycles
0 references
linear feasibility
0 references
traveling salesman problem
0 references
polyhedra
0 references
0 references
0.9232314
0 references
0.90980303
0 references
0.88385963
0 references
0 references
0.8825578
0 references
0.88162327
0 references
0.8811172
0 references
