A model of the coNP-complete non-Hamilton tour decision problem for directed graphs (Q1885271): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-003-0480-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055791260 / rank | |||
Normal rank | |||
Latest revision as of 23:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A model of the coNP-complete non-Hamilton tour decision problem for directed graphs |
scientific article |
Statements
A model of the coNP-complete non-Hamilton tour decision problem for directed graphs (English)
0 references
28 October 2004
0 references
The authors present a linear system that models the coNP-complete non-Hamilton tour decision problem based upon constructing the convex hull of a set of truncated permutation matrix polytopes.
0 references
Hamiltonicity
0 references
pancyclic projection
0 references
assignment polytope
0 references
