Domain Reduction for the Circuit Constraint

  • Latife Genc Kaya
  • John Hooker
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

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.

References

  1. 1.
    Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. John Wiley Sons, Chichester (2000)MATHGoogle Scholar
  2. 2.
    Regin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraint. In: AAAI (1996)Google Scholar
  3. 3.
    Shufelt, J., Berliner, H.: Generating Hamiltonian Circuits Without Backtracking from Errors. Theoretical Computer Science 132(1-2), 347–375 (1994)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

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

Personalised recommendations