Talk:Decomposition method (constraint satisfaction)
To do:
- Clique-width
- Generalized hypergraph decomposition
- Width of tree clustering
- Tree decomposition for hypergraph (based on primal graph)
- Hinge+tree clustering
- Computing width and decomposition (cost)
- Other structural restriction (mention)
- Algorithms for the resulting acyclic problems: dac or specialized
- Using number of edges = more nodes in a single edge; example: single edge with n nodes
- Comparison
- First dualize