Jump to content

Talk:Decomposition method (constraint satisfaction)

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tizio (talk | contribs) at 15:24, 21 April 2006 (drawing done). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

To do:

  • condition equivalent to hypergraph acyclicity this is said in tree clustering; move above?
  • clique-width
  • computing width and decomposition (cost, LOGCFL)
  • other structural restrictions: anything to add?
  • algorithms for the resulting acyclic problems: something else to be mentioned here?

- Liberatore(T) 19:37, 13 April 2006 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Decomposition_method_(constraint_satisfaction)&oldid=49454424"