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.
Work supported by a DST-DAAD project grant for exchange visits.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arvind, V., Kurur, P., Vijayaraghavan, T.: Bounded color multiplicity graph isomorphism is in the #L hierarchy. In: Proc. 20th Annual IEEE Conference on Computational Complexity, pp. 13–27. IEEE Computer Society Press, Los Alamitos (2005)
Babai, L., Luks, E.: Canonical labeling of graphs. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 171–183 (1983)
Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-MOD classes. Mathematical Systems Theory 25, 223–237 (1992)
Cai, J., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identifications. Combinatorica 12(4), 389–410 (1992)
Furst, M., Hopcroft, J., Luks, E.: Polynomial time algorithms for permutation groups. In: Proc. 21st IEEE Symposium on the Foundations of Computer Science, pp. 36–41. IEEE Computer Society Press, Los Alamitos (1980)
Jenner, B., Köbler, J., McKenzie, P., Torán, J.: Completeness results for graph isomorphism. Journal of Computer and System Sciences 66, 549–566 (2003)
Luks, E.: Isomorphism of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences 25, 42–65 (1982)
Luks, E.: Parallel algorithms for permutation groups and graph isomorphism. In: Proc. 27th IEEE Symposium on the Foundations of Computer Science, pp. 292–302. IEEE Computer Society Press, Los Alamitos (1986)
Luks, E.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proc. 31st ACM Symposium on Theory of Computing, pp. 652–658. ACM Press, New York (1999)
Reingold, O.: Undirected st-connectivity in log-space. In: Proc. 37th ACM Symposium on Theory of Computing, pp. 376–385. ACM Press, New York (2005)
Torán, J.: On the hardness of graph isomorphism. SIAM Journal on Computing 33(5), 1093–1108 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arvind, V., Köbler, J. (2006). On Hypergraph and Graph Isomorphism with Bounded Color Classes. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_31
Download citation
DOI: https://doi.org/10.1007/11672142_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)