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 18:25, 13 April 2006 (something 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 acyclicity
  • Clique-width
  • Computing width and decomposition (cost)
  • Other structural restrictions (mention)
  • Algorithms for the resulting acyclic problems: dac or specialized

- Liberatore(T) 18:25, 13 April 2006 (UTC)[reply]