A model of the coNP-complete non-Hamilton tour decision problem for directed graphs (Q1885271): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 1 February 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
