Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete

Lydia E. Kavraki, Mihail N. Kolountzakis. Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete. Inf. Process. Lett., 55(3):159-165, 1995. [doi]

Abstract

Abstract is missing.