New structural decomposition techniques for constraint satisfaction problems
From MaRDI portal
Recommendations
- A new approach to partial constraint satisfaction problems
- On the power of structural decompositions of graph-based representations of constraint problems
- The Structure of Tractable Constraint Satisfaction Problems
- Structural decompositions for problems with global constraints
- A new tractable class of constraint satisfaction problems
- Fast and parallel decomposition of constraint satisfaction problems
- A domain decomposition algorithm for constraint satisfaction
- On algorithms for decomposable constraints
- Solving satisfiability using decomposition and the most constrained subproblem
Cited in
(14)- Dynamic structural symmetry breaking for constraint satisfaction problems
- Decomposing constraint satisfaction problems using database techniques
- A comparison of structural CSP decomposition methods
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Tree decomposition method combined with separator in constraint satisfaction problems
- scientific article; zbMATH DE number 1149412 (Why is no real title available?)
- A new approach to partial constraint satisfaction problems
- On algorithms for decomposable constraints
- Combining restarts, nogoods and decompositions for solving CSPs
- A domain decomposition algorithm for constraint satisfaction
- Incremental Updates of Generalized Hypertree Decompositions
- Strictly chordal graphs are leaf powers
- A unified theory of structural tractability for constraint satisfaction problems
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: New structural decomposition techniques for constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703916)