1.Previous
3.Next

dual graphs are trees or forests can be solved in polynomial time. This affect the choice of the variables evaluated by search. Indeed, once a variable is evaluated, it can effectively removed from the graph, restricting all constraints it is involved with its value. Alternatively, an evaluated variable can be replaced by a number of distinct variables, one for each constraint, all having a single-value domain. This mixed algorithm is efficient if the search variables are chosen so that duplicating or deleting them turns the problem into one

1.Previous
3.Next