Content deleted Content added
Diego Moya (talk | contribs) →Decomposition methods for arbitrary problems: Fixing incorrect redirect |
Diego Moya (talk | contribs) |
||
Line 40:
==Decomposition methods for binary problems==
A number of decomposition methods exist. Most of them generate a tractable class by bounding the width of instances. The following are the decomposition methods defined for binary constraint satisfaction problems. Since a problem can be made binary by translating it into its [[Constraint satisfaction dual problem|dual problem]] or using [[Hidden transformation|hidden variables]], these methods can be indirectly used to provide a tree decomposition for arbitrary constraint satisfaction problems.
===Biconnected components===
| |||