Colored Hypergraph Isomorphism is Fixed Parameter Tractable

We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2O(b) NO(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.

• Type: Journal
• Year: 2010
• Where: FSTTCS
• Authors: Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
• Keywords: Algorithm, Certain Permutation Group, Fixed Parameter, FSTTCS 2010, Software Engineering