Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Arvind, V., & Köbler, J. (2006). On hypergraph and graph isomorphism with bounded color classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3884 LNCS, pp. 384–395). https://doi.org/10.1007/11672142_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free