Partitioning a planar assembly into two connected parts is NP-complete

Lydia E. Kavraki, Mihail N. Kolountzakis
  • Information Processing Letters, August 1995, Elsevier
  • DOI: 10.1016/0020-0190(95)00083-o
The author haven't finished explaining this publicationThe author haven't finished explaining this publication

The following have contributed to this page: Professor Lydia E Kavraki