Talk:Decomposition method (constraint satisfaction)

To do:

• drawing on an example, similar to that at Constraint satisfaction dual problem
• condition equivalent to hypergraph acyclicity this is said in tree clustering; move above?
• clique-width
• computing width and decomposition (cost, LOGCFL)
• other structural restrictions: anything to add?
• algorithms for the resulting acyclic problems: something else to be mentioned here?

- Liberatore(T) 19:37, 13 April 2006 (UTC)