Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
classification
💻 cs.CC
keywords
algorithmeigenvalueisomorphismmultiplicitytimebestboundbounded
read the original abstract
We give a $O^*(k^{O(k)})$ time isomorphism testing algorithm for graphs of eigenvalue multiplicity bounded by $k$ which improves on the previous best running time bound of $O^*(2^{O(k^2/\log k)})$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.