Date of Original Version

9-2006

Type

Book Chapter

Abstract or Description

We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonhamiltonian edges from the associated graph. We identify nonhamiltonian edges by analyzing a smaller graph with labeled edges that is defined on a separator of the original graph. The complexity of the procedure for each separator S is approximately O(|S|5).We found that it identified all infeasible instances and eliminated about one-third of the redundant domain elements in feasible instances.

DOI

10.1007/11889205_55

Share

COinS
 

Published In

F. Benhamou, ed., Principles and Practice of Constraint Programming (CP 2006), LNCS 4204, 706-710.