The Consistent Labeling Problem: Part II

DOI10.1109/TPAMI.1980.4767007MaRDI QIDQ3890138zbMATH OpenOpenAlexWikidataFDO

Authors Robert Haralick, Linda G. Shapiro

Publication date 1980

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

Full work available at URL https://doi.org/10.1109/tpami.1980.4767007

zbMATH Keywords

backtrackingconsistent labelinglook-ahead operatorsmatchingscene analysistree search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Artificial intelligence (68T99)

Recommendations

• scientific article; zbMATH DE number 1759551
• An optimal k-consistency algorithm
• Principles and Practice of Constraint Programming – CP 2004
• No more ``Partial and ``Full Looking Ahead
• Constraints, consistency and closure

Cited in

(5)

• Constraint propagation techniques for the disjunctive scheduling problem
• Efficient graph automorphism by vertex partitioning
• On the arc consistency problem
• scientific article; zbMATH DE number 1759551 (Why is no real title available?)
• Incremental labeling in closed-2PM model

This page was built for publication: The Consistent Labeling Problem: Part II

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