1 research outputs found
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
We give a time isomorphism testing algorithm for graphs of
eigenvalue multiplicity bounded by which improves on the previous best
running time bound of