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.
Graphs that depict the relationships between constraints in a constraint satisfaction problem, known as join graphs and join trees, represent either the dual problem or a modified version of the original problem with redundant constraints removed.