Domain Reduction for the Circuit Constraint

  • Latife Genc Kaya
  • John Hooker
Conference paper

DOI: 10.1007/11564751_84

Volume 3709 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Kaya L.G., Hooker J. (2005) Domain Reduction for the Circuit Constraint. In: van Beek P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg

Abstract

We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating non-Hamiltonian edges from the associated graph. We prove a necessary condition for an edge to be Hamiltonian, which provides the basis for eliminating edges of a smaller graph defined on a separator of the original graph.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Latife Genc Kaya
    • 1
  • John Hooker
    • 1
  1. 1.Carnegie Mellon UniversityPittsburghUSA