Next: About this document
Up: Introduction
Previous: Results
References

 CSPLib

CSPLib: a problem library for constraints
http://www.csplib.org
 Gallian, 2002

J. A. Gallian.
A Dynamic Survey of Graph Labeling.
The Electronic Journal of Combinatorics, (DS6), 2002.
http://www.combinatorics.org/Surveys. (postscript)
 GAP, 2002

The GAP Group.
GAP  Groups, Algorithms, and Programming, Version 4.3,
2002.
http://www.gapsystem.org.
 Gent and Smith, 2000

I. P. Gent and B. M. Smith.
Symmetry Breaking During Search in Constraint Programming.
In W. Horn, editor, Proceedings ECAI'2000, pages 599603,
2000.
 Gent et al., 2002

I. P. Gent, W. Harvey, and T. Kelsey.
Groups and Constraints: Symmetry Breaking during Search.
In P. van Hentenryck, editor, Principles and Practice of
Constraint Programming  CP 2002, LNCS 2470, pages 415430. Springer, 2002.
 Lustig and Puget, 2001

I. J. Lustig and J.F. Puget.
Program Does Not Equal Program: Constraint Programming and Its
Relationship to Mathematical Programming.
INTERFACES, 31(6):2953, 2001.
 Petrie and Smith, 2003

K. E. Petrie and B. M. Smith.
Symmetry Breaking in Graceful Graphs
Report APES562003, available from
http://www.dcs.stand.ac.uk/~apes/apesreports.html
Next: About this document
Up: Introduction
Previous: Results
Barbara Smith
January 2003