The join graphs and join trees of a constraint satisfaction problem are graphs representing its dual problem or a problem obtained from the dual problem removing some redundant constraints.
The join graphs and join trees of a constraint satisfaction problem are graphical representations of its dual problem or a problem derived from the dual problem by removing redundant constraints.