Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 897363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Hamiltonian cycles in Delaunay triangulations is NP-complete |
scientific article; zbMATH DE number 897363 |
Statements
Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (English)
0 references
4 August 1996
0 references
It is shown that it is an NP-complete problem to determine whether a nondegenerate Delaunay triangulation or an inscribable polyhedron has a Hamiltonian cycle. There are also constructed a nondegenerate Delaunay triangulation and a simplicial, inscribable polyhedron, without 2-factors.
0 references
NP-complete problem
0 references
Delaunay triangulation
0 references
inscribable polyhedron
0 references
Hamiltonian cycle
0 references
2-factors
0 references
0 references
0.7762501239776611
0 references
0.7710272669792175
0 references
0.7679218649864197
0 references
0.7569814324378967
0 references
