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 authors haven't finished explaining this publication. If you are the author, sign in to claim or explain your work.

Read Publication

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