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

Content deleted Content added
some done, some add
acyclicity
Line 2:
 
* drawing on an example, similar to that at [[Constraint satisfaction dual problem]]
* <s>condition equivalent to hypergraph acyclicity</s> this is said in tree clustering; move above?
* clique-width
* computing width and decomposition (cost, [[LOGCFL]])