مرکز منطقه ای اطلاع رساني علوم و فناوري - Partitioning a planar assembly into two connected parts is NP-complete

Title of article :

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

Author/Authors :

Lydia E. Kavraki، نويسنده , , Mihail N. Kolountzakis، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1995

Pages :

From page :

159

To page :

165

Keywords :

computational complexity , Assembly planning , motion planning , Computational geometry

Journal title :

Information Processing Letters

Serial Year :

1995

Journal title :

Information Processing Letters

Record number :

128314

Link To Document :