Computing Simple Circuits from a Set of Line Segments is NP-Complete (Q3034824): 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.1137/0218075 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028883079 / rank | |||
Normal rank | |||
Latest revision as of 22:28, 19 March 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
