Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Big data analytics often requires processing complex queries using massive parallelism, where the main performance metrics is the… 
2014
2014
Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can… 
2010
2010
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractable subclasses that rely on the… 
Highly Cited
2009
Highly Cited
2009
In this paper, we introduce an on-line, decentralised coordination algorithm for monitoring and predicting the state of spatial… 
2009
2009
  • M. SamerH. Veith
  • International Conference on Theory and…
  • 2009
  • Corpus ID: 17791966
One of the most important structural parameters of graphs is treewidth , a measure for the "tree-likeness" and thus in many cases… 
Highly Cited
2005
Review
2001
Review
2001
This paper surveys recent results related to the concept of hypertree decomposition and the associated notion of hypertree width… 
Highly Cited
1999
Highly Cited
1999
Highly Cited
1999
Highly Cited
1999
  • R. Dechter
  • Artificial Intelligence
  • 1999
  • Corpus ID: 996561
Highly Cited
1998
Highly Cited
1998
1 A preliminary version of this paper appeared in the ‘‘Proceedings of the Eighteenth ACM Symposium on Principles of Database…