Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke
(Springer, 2015-01)
We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2 b N) O(1), where the parameter b is the maximum size of the color classes of the given ...