Discrete Optimization by Relational Constraint Satisfaction

DOI10.1109/TPAMI.1982.4767300zbMath0497.49027WikidataQ52720737 ScholiaQ52720737MaRDI QIDQ3962068

Julian R. Ullmann

Publication date: 1982

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

zbMATH Keywords

pattern matchingconstraint satisfactionconsistent labelingdiscrete relaxation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39) Pattern recognition, speech recognition (68T10) Enumeration in graph theory (05C30) Numerical methods of relaxation type (49M20)

Related Items (1)

Partition search for non-binary constraint satisfaction

This page was built for publication: Discrete Optimization by Relational Constraint Satisfaction