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

Revision as of 11:55, 15 June 2009

Revision as of 11:57, 15 June 2009

Line 12:

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. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/78.142.164.236|78.142.164.236]] ([[User talk:78.142.164.236|talk]]) 11:55, 15 June 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->