Symmetry Breaking in Graceful Graphs

  • Karen E. Petrie
  • Barbara M. Smith
Conference paper

DOI: 10.1007/978-3-540-45193-8_81

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2833)
Cite this paper as:
Petrie K.E., Smith B.M. (2003) Symmetry Breaking in Graceful Graphs. In: Rossi F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Karen E. Petrie
    • 1
  • Barbara M. Smith
    • 1
  1. 1.School of Computing & EngineeringUniversity of HuddersfieldUK

Personalised recommendations