A hybrid tractable class for non-binary CSPs
From MaRDI portal
Recommendations
Cites work
- A hybrid tractable class for non-binary CSPs
- A new class of binary CSPs for which arc-consistency is a decision procedure
- A Sufficient Condition for Backtrack-Free Search
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Characterising tractable constraints
- Degrees of acyclicity for hypergraphs and relational database schemes
- Domain filtering consistencies for non-binary constraints
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Graph minors. II. Algorithmic aspects of tree-width
- Handbook of constraint programming.
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- On the Desirability of Acyclic Database Schemes
- On the minimality and global consistency of row-convex constraint networks
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- Some new tractable classes of CSPs and their relations with backtracking algorithms
- Tractable constraints on ordered domains
Cited in
(5)
This page was built for publication: A hybrid tractable class for non-binary CSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903910)