COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable
From MaRDI portal
Publication:2908862
DOI10.4230/LIPIcs.FSTTCS.2010.327zbMath1245.68098OpenAlexW2171133573MaRDI QIDQ2908862
V. Arvind, Bireswar Das, Seinosuke Toda, Johannes Köbler
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_394c.html
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Towards an isomorphism dichotomy for hereditary graph classes ⋮ Colored hypergraph isomorphism is fixed parameter tractable
This page was built for publication: COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable
