Reduction operations for constraint satisfaction

DOI10.1016/0020-0255(78)90043-9zbMath0416.68042OpenAlexW2048257758MaRDI QIDQ754642

David L. Milgram, Robert M. Haralick, Azriel Rosenfeld, Larry S. Davis

Publication date: 1978

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(78)90043-9

zbMATH Keywords

constraint satisfactioncomputational coststorage requirementsNp-completenessbacktracking processlabeling a setreduction operationssatisfaction of a compatibility relation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (5)

Graph Transduction as a Noncooperative Game ⋮ Partition search for non-binary constraint satisfaction ⋮ Parallel consistent labeling algorithms ⋮ On the arc consistency problem ⋮ Dynamic variable ordering in graph based backjumping algorithms for csps

Cites Work

• Unnamed Item
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Networks of Automata: Some Applications
• Multidimensional binary search trees used for associative searching
• Scene Labeling by Relaxation Operations

This page was built for publication: Reduction operations for constraint satisfaction