Reduction operations for constraint satisfaction

DOI10.1016/0020-0255(78)90043-9zbMATH Open0416.68042OpenAlexW2048257758MaRDI QIDQ754642FDOQ754642

David L. Milgram, Robert 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)

Cites Work

• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• Multidimensional binary search trees used for associative searching
• Title not available (Why is that?)
• Scene Labeling by Relaxation Operations
• Networks of Automata: Some Applications

Cited In (5)

• Parallel consistent labeling algorithms
• Graph transduction as a noncooperative game
• Dynamic variable ordering in graph based backjumping algorithms for csps
• Partition search for non-binary constraint satisfaction
• On the arc consistency problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754642)