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

Lydia E. Kavraki, Mihail N. Kolountzakis (1995)

Details and statistics

DOI: 10.1016/0020-0190(95)00083-O

access: closed

type: Journal Article

metadata version: 2018-11-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics