On Hypergraph and Graph Isomorphism with Bounded Color Classes

DOI10.1007/11672142_31zbMath1136.68446OpenAlexW1869960717MaRDI QIDQ5449815

V. Arvind, Johannes Köbler

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

The parallel complexity of graph canonization under abelian group action ⋮ Automorphisms of the cube \(n^d\) ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ Automorphisms of the Cube $$n^d$$ ⋮ Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm

This page was built for publication: On Hypergraph and Graph Isomorphism with Bounded Color Classes