Computing Simple Circuits from a Set of Line Segments is NP-Complete (Q3034824): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:38, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Simple Circuits from a Set of Line Segments is NP-Complete |
scientific article |
Statements
Computing Simple Circuits from a Set of Line Segments is NP-Complete (English)
0 references
1989
0 references
NP-complete problem
0 references
Hamiltonian path
0 references
Euclidean travelling salesman problem
0 references
computational geometry
0 references
line segments
0 references
complexity classes
0 references
