Reduction operations for constraint satisfaction |
| |
| Authors: | Robert M Haralick Larry S Davis Azriel Rosenfeld David L Milgram |
| |
| Affiliation: | Computer Science Center, University of Maryland, College Park, Maryland 20742, USA |
| |
| Abstract: | The problem of labeling a set of units in such a way as to satisfy an order-N compatibility relation is discussed and shown to be NP-complete. Some general procedures for reducing size of the compatibility relation are defined, properties of these procedures are derived, and their incorporation into a backtracking process is discussed. Their computational cost and storage requirements are also considered. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
