Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity.

Vikraman Arvind Gaurav Rattan

Published in: CoRR (2014)

Keyphrases

graph isomorphism
dynamic programming
optimal solution
computational complexity
matching algorithm
objective function
np hard
lower bound
pairwise
tree structure