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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kaya, L. G., & Hooker, J. N. (2006). A filter for the circuit constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4204 LNCS, pp. 706–710). Springer Verlag. https://doi.org/10.1007/11889205_55
Mendeley helps you to discover research relevant for your work.