| << Prev | - Up - | Next >> |
We will consider a dominance constraint as a graph, its constraint graph. Each node of the constraint graph corresponds to a variable in the constraint. The graph can be seen as a variable centered representation of the constraint. All information distributed over several occurences of a variable in a dominance constraint is centered around a single node of the constraint graph.
Note also the we have already seen graphs in the motivating examples above. All these graphs can be seen as the constraint graph of some dominance constraint.
| << Prev | - Up - | Next >> |