Principles and Practice of Constraint Programming - CP 2005

Volume 3709 of the series Lecture Notes in Computer Science pp 846-846

Domain Reduction for the Circuit Constraint

  • Latife Genc KayaAffiliated withCarnegie Mellon University
  • , John HookerAffiliated withCarnegie Mellon University

* Final gross prices may vary according to local VAT.

Get Access


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.