Colored hypergraph isomorphism is fixed parameter tractable
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 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.
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 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.
Colored hypergraph isomorphism is fixed parameter tractable
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.
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.
Showing the best results for this search. See all results