Touring Disjoint Polygons Problem Is NP-Hard (Q2867133)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Touring Disjoint Polygons Problem Is NP-Hard |
scientific article |
Statements
Touring Disjoint Polygons Problem Is NP-Hard (English)
0 references
10 December 2013
0 references