Classification of three-class association schemes using backtracking with dynamic variable ordering

Discrete Mathematics

Volumn 300, Issue 1-3, 2005, Pages 71-81

  Degraer, J ^a   Coolsaet, K ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Association schemes; Computer classification; Dynamic variable ordering; Forward checking

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL TECHNIQUES;

ASSOCIATION SCHEMES; COMPUTER CLASSIFICATION; DYNAMIC VARIABLE ORDERING; FORWARD CHECKING;

NUMBER THEORY;

EID: 25444480492     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.06.014     Document Type: Article

References (15)

1. R.J.R. Abel, S.C. Furino, Resolvable and near resolvable designs, in: Ch. J. Colbourn, J.H. Dinitz (Eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996 (Chapter I.6).
2. A.E. Brouwer, A.M. Cohen, and A. Neumaier Distance-Regular Graphs 1989 Springer Heidelberg
3. A.E. Brouwer, and W.H. Haemers Association schemes R.L. Graham M. Grötschel L. Lovász Handbook of Combinatorics 1995 Elsevier Science Amsterdam
4. K. Coolsaet, and J. Degraer A computer assisted proof of the uniqueness of the Perkel graph Designs Codes Cryptogr. 34 2-3 2005 155 171
5. D.G. Fon-Der-Flaass New prolific constructions of strongly regular graphs Adv. Geom. 2 3 2002 301 306
6. W. Haemers, and E. Spence The pseudo-geometric graphs for generalised quadrangles of order (3, t ) European J. Combin. 22 2001 839 845
7. W.H. Haemers, and V.D. Tonchev Spreads in strongly regular graphs Designs Codes Cryptogr. 8 1996 145 157
8. R. Haralick, and G. Elliott Increasing tree search efficiency for constraint-satisfaction problems Artif. Intell. 14 3 1980 263 313
9. B.D. McKay, Nauty User's Guide (version 1.5), Technical Report TR-CS-90-02, Dept. Computer Science, Austral. Nat. Univ., 1990.
10. B.D. McKay Isomorph-free exhaustive generation J. Algorithms 26 1998 306 324
11. B.D. McKay, and E. Spence Classification of regular two-graphs on 36 and 38 vertices Australas. J. Combin. 24 2001 293 300
12. R.C. Read Every one a winner, or, how to avoid isomorphism search when cataloguing combinatorial configurations Ann. Discrete Math. 2 1978 107 120
13. E. Spence The strongly regular (40,12,2,4) graphs Elec. J. Combin. 7 1 2000
14. E. Spence, Strongly regular graphs on at most 64 vertices, URL (2003), http://www.maths.gla.ac.uk/~es/srgraphs.html
15. E.R. Van Dam Three-class association schemes J. Algebraic Combin. 10 1999 69 107