Domain Reduction for the Circuit Constraint

Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated graph (i.e., edges that are part of no Hamiltonian cycle). 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.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Latife Genç Kaya, John N. Hooker
• Keywords: CP 2005, Incomplete filtering Algorithm, NonHamiltonian Edges, Programming Languages, Removes Redundant Values