FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
010203019762017

Related topics

Related topics

16 relations
Biconnected componentBinary constraintComplexity of constraint satisfactionConstraint satisfaction
(More)

Broader (1)

Constraint programming

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Decomposition method (constraint satisfaction)
P (complexity)
Directed acyclic graph
Biconnected component
Constraint satisfaction
Constraint satisfaction problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Layout Decomposition for Triple Patterning Lithography
As minimum feature size and pitch spacing further decrease, triple patterning lithography (TPL) is a possible 193nm extension… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a… (More)
Is this relevant?
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… (More)
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 2.3
Is this relevant?
2005
2005
A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition
In this paper we introduce a generic form of structural decomposition for the constraint satisfaction problem, which we call a… (More)
  • figure 1
Is this relevant?
2004
2004
New Structural Decomposition Techniques for Constraint Satisfaction Problems
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Iterative Join-Graph Propagation
The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering… (More)
  • figure 8
  • figure 9
  • figure 12
  • figure 13
  • figure 14
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Hypertree Decompositions and Tractable Queries
Several important decision problems on conjunctive queries (CQs) are NP-complete in general but become tractable, and actually… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
1999
Review
1999
A Comparison of Structural CSP Decomposition Methods
We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Single evoked potential reconstruction by means of wavelet transform
We would like to propose a method of single evoked potential (EP) extraction free from assumptions and based on a novel approach… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 8
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Nonlinear Solution of Linear Inverse Problems by Wavelet-Vaguelette Decomposition
We describe the Wavelet-Vaguelette Decomposition (WVD) of a linear inverse problem. It is a substitute for the singular value… (More)
Is this relevant?