Arvind, V.V.ArvindDas, BireswarBireswarDasKöbler, JohannesJohannesKöblerToda, SeinosukeSeinosukeToda2025-08-302025-08-302015-01-0110.1007/s00453-013-9787-y2-s2.0-84922000474https://d8.irins.org/handle/IITG2025/21531We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2^bN)^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 an fpt algorithm for a parameterized coset intersection problem that is used as a subroutine in our algorithm for CHI.falseComputational complexity | Fixed parameter tractability | Fpt algorithms | Graph isomorphismArticlehttps://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.32714320541120-138January 201312arJournal9WOS:000348206400008