Skip to search formSkip to main contentSkip to account menu

Constraint satisfaction dual problem

Known as: Join graph 
The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
AlgorithmBinary constraintConstraint satisfaction problemDecomposition method (constraint satisfaction)

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Googling the Deep Web (Extended abstract)
The Deep Web is constituted by data that are accessible through Web pages, but not indexable by search engines as they are… 
2012
2012
A Scheduling Algorithm for Fork-Join DAG in Bus-based and Heterogeneous Environment
The Fork-Join task graph is one of the basic modeling structures for parallel processing. However, many previous scheduling… 
2010
2010
Let SQL drive the XQuery workhorse (XQuery join graph isolation)
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor… 
2009
2009
Equitable total coloring of Fn ⋁ Wn
The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted… 
2009
2009
On the Equitable Total Coloring of the Join Graph of Fan and Complete Balanced 2-partite Graph
A proper total-coloring of a graph is called equitable if ||Ti|-|Tj||≤1,the |Ti| is called chromatic number of the i color.For a… 
2008
2008
XQuery Join Graph Isolation: Celebrating 30+ Years of XQuery Processing Technology
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor… 
2002
2002
Graph partition based multi-way spatial joins
We investigate the problem of efficiently computing a multi-way spatial join without spatial indexes. We propose a novel and… 
1998
1998
Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections
The generally accepted optimization heuristics of pushing selections down does not yield optimal plans in the presence of… 
1991
1991
Optimizing joins between two fragmented relations on an broadcast local network
1986
1986
Taxonomy and formal properties of distributed joins
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)