Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Decomposition method (constraint satisfaction)

Known as: Decomposition method, Hypertree decomposition, Join-tree clustering 
In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is… Expand
Wikipedia

Related topics

Related topics

16 relations
Biconnected componentBinary constraintComplexity of constraint satisfactionConstraint satisfaction
Expand

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems
 
2014
2014
GYM: A Multiround Join Algorithm In MapReduce
Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
2010
2010
Exploiting parallelism in decomposition methods for constraint satisfaction
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractable subclasses that rely on the… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 3.1
Highly Cited
2010
Highly Cited
2010
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes… Expand
  • figure 1
Highly Cited
2009
Highly Cited
2009
Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm
In this paper, we introduce an on-line, decentralised coordination algorithm for monitoring and predicting the state of spatial… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2008
2008
Understanding Tractable Decompositions for Constraint Satisfaction
Constraint satisfaction problems (CSPs) are NP-complete in general, therefore it is important to identify tractable subclasses. A… Expand
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 2.3
Highly Cited
2005
Highly Cited
2005
Unifying tree decompositions for reasoning in graphical models
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Highly Cited
1999
Highly Cited
1999
A Comparison of Structural CSP Decomposition Methods
Abstract We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Highly Cited
1999
Highly Cited
1999
Hypertree decompositions and tractable queries
1 A preliminary version of this paper appeared in the ‘‘Proceedings of the Eighteenth ACM Symposium on Principles of Database… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE