Under the auspices of the Computational Complexity Foundation (CCF)
We give a $O^*(k^{O(k)})$ time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by $k$ which improves on the previousbest running time bound of $O^*(2^{O(k^2/\log k)})$.
