Arvind, V.; Das, Bireswar; Köbler, Johannes; Seinosuke, Toda
(2010)
We describe a xed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism
which has running time 2 O (b)NO(1), where the parameter is the maximum size of the color classes of the given hypergraphs and N ...