# (solution) Consider the constraint graph of Figure 4.15 with named binary constraints [e.g., r 1 is a relation

Consider the constraint graph of Figure 4.15 with named binary constraints [e.g., r 1 is a relation on A and B , which we can write as r 1 ( A , B )]. Consider solving this network using VE. Suppose you were to eliminate variable A . Which constraints are removed? A constraint is created on which variables? (You can call this r 11 ). Suppose you were to subsequently eliminate B (i.e., after eliminating A ). Which relations are removed? A constraint is created on which variables?