Talk:Decomposition method (constraint satisfaction): Difference between revisions

Revision as of 18:25, 13 April 2006

Revision as of 19:37, 13 April 2006

Line 1:

To do:

* drawing on an example, similar to that at [[Constraint satisfaction dual problem]]

* Conditioncondition equivalent to acyclicity

* Cliqueclique-width

* Computingcomputing width and decomposition (cost, [[LOGCFL]])

* Other<s>other structural restrictions</s>: (mention)anything to add?

* Algorithms<s>algorithms for the resulting acyclic problems:</s> dacsomething orelse specializedto be mentioned here?

- [[User:Paolo Liberatore|Liberatore]]([[User talk:Paolo Liberatore|T]]) 1819:2537, 13 April 2006 (UTC)