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… 
Highly Cited
2009
Highly Cited
2009
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes… 
Highly Cited
2002
Highly Cited
2002
The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering… 
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…