Computing Isomorphisms of Association Schemes and its Application

Isomorphisms of association schemes are isomorphisms of edge-labeled regular graphs permitting to permute the labels. We give an algorithm computing isomorphisms of association schemes using their algebraic property. We also study an application of computing isomorphisms of association schemes to computing normalizers of permutation groups.