We are interested in classifying all association schemes (strongly regular graphs, distance regular graph, ...) given a certain parameter set by computer (up to isomorphism).
The classification mostly involves algorithms which require a recursive traversal of a tree-like search space using various pruning heuristics.
On the one hand we try to design, improve and study these combinatorial algorithms, but on the other hand we also apply these algorithms to specific parameter sets, hoping to generate new mathematical results.
Supervisor:
Prof.Dr. Kris Coolsaet, Universiteit Gent.