Open AccessArticle10.1007/s00453-013-9787-y

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

V. Arvind,Bireswar Das,Johannes Köbler,Seinosuke Toda-2013-04-30-Algorithmica

2

Chat with Paper

AI Agents for this Paper

No abstract available for this paper.

Keywords

Parameterized complexityHypergraphColoredIntersection (aeronautics)CombinatoricsMathematicsIsomorphism (crystallography)Discrete mathematics

Chat

Click to start Chat