Partitioning a planar assembly into two connected parts is NP-complete (Q672026)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a planar assembly into two connected parts is NP-complete |
scientific article |
Statements
Partitioning a planar assembly into two connected parts is NP-complete (English)
0 references
27 February 1997
0 references
Computational complexity
0 references
Computational geometry
0 references
Assembly planning
0 references
Motion planning
0 references
0 references
