Principles and Practice of Constraint Programming – CP 2003

Volume 2833 of the series Lecture Notes in Computer Science pp 930-934

Symmetry Breaking in Graceful Graphs

  • Karen E. PetrieAffiliated withSchool of Computing & Engineering, University of Huddersfield
  • , Barbara M. SmithAffiliated withSchool of Computing & Engineering, University of Huddersfield

* Final gross prices may vary according to local VAT.

Get Access


Symmetry occurs frequently in Constraint Satisfaction Problems (CSPs). For instance, in 3-colouring the nodes of a graph, a CSP model that assigns a specific colour to each node has sets of equivalent solutions in which the three colours are permuted. Symmetry in CSPs can cause wasted search, because the search for solutions may repeatedly visit partial assignments symmetric to ones already considered. If a partial assignment does not lead to a solution, neither will any symmetrically equivalent assignment. When searching for all solutions, for every solution found, all the symmetrically equivalent solutions will also be found.