Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete.
Lydia E. KavrakiMihail N. KolountzakisPublished in: Inf. Process. Lett. (1995)
Keyphrases
- np complete
- np hard
- randomly generated
- computational complexity
- constraint satisfaction problems
- connected components
- conjunctive queries
- bounded treewidth
- satisfiability problem
- graph partitioning
- phase transition
- polynomial time complexity
- partitioning algorithm
- pspace complete
- data sets
- description logics
- planar surfaces
- data complexity
- neural network