A domain decomposition algorithm for constraint satisfaction

DOI10.1145/1412228.1455269zbMath1284.68721OpenAlexW2059507248MaRDI QIDQ5406183

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 satisfaction problemsdomain decomposition algorithmsconstraint graph orientationvalue substitutability

Mathematics Subject Classification ID

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

Related Items (1)

Modularity-based decompositions for valued CSP

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