Decomposition method (constraint satisfaction)
 | This article is actively undergoing a major edit for a little while. To help avoid edit conflicts, please do not edit this page while this message is displayed. This page was last edited at 15:09, 11 April 2006 (UTC) (19 years ago) – this estimate is cached, . Please remove this template if this page hasn't been edited for a significant time. If you are the editor who added this template, please be sure to remove it or replace it with {{Under construction}} between editing sessions. |
In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into a binary acyclic one. Decomposition methods work by grouping variables into sets, and solving a subproblem for each set. This translation is motivated by the tractability of solving binary acyclic problems.