Details

Autor(en) / Beteiligte

• Arvind, V.
• Köbler, Johannes

Titel

On Hypergraph and Graph Isomorphism with Bounded Color Classes

Ist Teil von

• Lecture notes in computer science, 2006, p.384-395

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2006

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Using logspace counting classes we study the computational complexity of hypergraph and graph isomorphism where the vertex sets have bounded color classes for certain specific bounds. We also give a polynomial-time algorithm for hypergraph isomorphism for bounded color classes of arbitrary size.