(SI) V okviru tega projekta načrtujemo razviti učinkovite algoritme za testiranje izomorfnosti Cayleyjevih grafov nad abelovih grupah ter za določitev dva-zaključke od določnih rešivljih permutacisjkih grup.
(EN) In the frame of this project, we are also interested in computational problems related to the isomorphism problem for graphs and the automorphism groups of association schemes. More exactly, we plan to develop efficient algorithms for testing the isomorphism of Cayley graphs over some abelian groups and for finding the two-closure of certain solvable permutation groups.