A Filter for the Circuit Constraint

  • Latife Genç Kaya
  • J. N. Hooker
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)


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.


Directed Graph Hamiltonian Cycle Vertex Degree Label Edge Small Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: Naish, L. (ed.) Proceedings, Fourteenth International Conference on Logic Programming (ICLP 1997), pp. 316–330. MIT Press, Cambridge (1997)Google Scholar
  2. 2.
    Chvátal, V.: Edmonds polytopes and weakly hamiltonian graphs. Mathematical Programming 5, 29–40 (1973)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chvátal, V.: Tough graphs and hamiltonian circuits. Discrete Mathematics 5, 215–228 (1973)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Shufelt, J., Berliner, H.: Generating hamiltonian circuits without backtracking from errors. Theoretical Computer Science 132, 347–375 (1994)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Latife Genç Kaya
    • 1
  • J. N. Hooker
    • 1
  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations