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

Content deleted Content added
something done
Cewbot (talk | contribs)
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}.
 
(11 intermediate revisions by 7 users not shown)
Line 1:
{{WikiProject banner shell|
{{WikiProject Computer science}}
}}
To do:
 
* Condition<s>condition equivalent to hypergraph acyclicity</s> this is said in tree clustering; move above?
* 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)
 
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-->
: I agree that the example was wrong and took the liberty to change the image. --[[Special:Contributions/84.114.18.215|84.114.18.215]] ([[User talk:84.114.18.215|talk]]) 21:03, 26 June 2012 (UTC)
 
 
Honestly, just scrap the subpoint about Hypertree Decompositions and start from scratch. It is sure to confuse anyone who is unfortunate enough to stumble across it (and doesn't even feature the proper definition) Even just literally copying and quoting the papers from Gottlob, Leone and Scarcello would be huge improvement, and more legible as well. [[Special:Contributions/128.131.196.163|128.131.196.163]] ([[User talk:128.131.196.163|talk]]) 11:29, 8 March 2019 (UTC)