Partitioning a planar assembly into two connected parts is NP-complete (Q672026)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 984731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a planar assembly into two connected parts is NP-complete |
scientific article; zbMATH DE number 984731 |
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
0.9102240800857544
0 references
0.7859299182891846
0 references
0.779093325138092
0 references
0.7711824774742126
0 references
