Colored Hypergraph Isomorphism is Fixed Parameter Tractable

V. Arvind, Bireswar Das, Johannes KöBler & Seinosuke Toda
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism} which has running time $2^{O(b)}N^{O(1)}$, where the parameter $b$ is the maximum size of the color classes of the given hypergraphs and $N$ is the input size. We also describe fpt algorithms for certain permutation group problems that are used as subroutines in our algorithm.