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

Revision as of 10:14, 11 October 2008

Revision as of 11:55, 15 June 2009

Line 9:

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

Is the decomposition-example correct? "For every edge of the original graph, there is a node that contains both its endpoints": z,w are connected in the original graph, but no node exists in the decomposed graph that contains both z and w.

Also, shouldn't it be "u,x,y" on the left side?

Perhaps I misunderstood hypertree decomposition, it would be nice if someone else could take a look at this.