1. J. C. Bermond and C. Peyrat. De bruijn and kautz networks: a competitor for the hypercube? Proc. of the 1st Europ. Workshop on Hypercubes and Distributed Computers, pp. 279–293, North-Holland, 1989.
2. CSPLib: a problem library for constraints, maintained by I. P. Gent, T. Walsh, B. Selman,
http://www-users.cs.york.ac.uk/~tw/csplib/
3. Lect Notes Comput Sci;R. Feldmann,1997
4. I. P. Gent and B. Smith. Symmetry Breaking During Search in Constraint Programming. Proc. of ECAI’2000, Berlin, pp. 599–603, 2000.
5. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.