A domain decomposition algorithm for constraint satisfaction

DOI10.1145/1412228.1455269MaRDI QIDQ5406183zbMATH OpenOpenAlexFDO

Authors Wady Naanaa

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1412228.1455269

zbMATH Keywords

constraint graph orientationconstraint satisfaction problemsdomain decomposition algorithmsvalue substitutability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Decomposable constraints
• scientific article; zbMATH DE number 2087248
• Directional Interchangeability for Enhancing CSP Solving
• Publication:3489461
• Recent Advances in Constraints

Cited in

(5)

• Fundamental properties of neighbourhood substitution in constraint satisfaction problems
• Domain permutation reduction for constraint satisfaction problems
• Modularity-based decompositions for valued CSP
• scientific article; zbMATH DE number 2087248 (Why is no real title available?)
• Recent Advances in Constraints

This page was built for publication: A domain decomposition algorithm for constraint satisfaction

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