Symmetry Breaking in Graceful Graphs
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.
Unable to display preview. Download preview PDF.
- 3.Gallian, J.A.: A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, DS6 (2002), http://www.combinatorics.org/Surveys
- 4.The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.3 (2002), http://www.gap-system.org
- 7.Gent, P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Horn, W. (ed.) Proceedings ECAI 2000, pp. 599–603 (2000)Google Scholar
- 8.Lustig, J., Puget, J.-F.: Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming. INTERFACES 31(6), 29–53 (2001)Google Scholar
- 9.Petrie, K.E., Smith, B.M.: Symmetry Breaking in Graceful Graphs. Technical Report APES-56a-2003, APES Research Group (June 2003), Available from http://www.dcs.st-and.ac.uk/~apes/apesreports.html