The complexity of graph isomorphism for colored graphs with color classes of size 2 and 3

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 121-132

  Köbler, Johannes ^a   Torán, Jacobo ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; SET THEORY;

CONNECTED COMPONENT; GRAPH AUTOMORPHISMS; GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; UNDIRECTED GRAPH; UPPER BOUND;

EQUIVALENCE CLASSES;

EID: 84937441492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_9     Document Type: Conference Paper

References (17)

1. Alvarez, C., Greenlaw, R.: A compendium of problems complete for symmetric logarithmic space.Journal of Computational Complexity 9 (2000) 73–95
2. Babai, L.: Monte carlo algorithms for graph isomorphism testing. Technical Report 79-10, Dép.Math.et Stat., Univ.de Montréal (1979)
3. Babai, L.: Moderately exponential bounds for graph isomorphism.In: Proc.In-ternational Symposium on Fundamentals of Computing Theory 81.Volume 117 of Lecture Notes in Computer Science., Springer-Verlag, Berlin Heidelberg New York (1981) 34–50
4. Buss, S.: Alogtime algorithms for tree isomorphism, comparison, and canonization. In: Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium’97. Volume 1289 of Lecture Notes in Computer Science., Springer-Verlag, Berlin Heidelberg New York (1997) 18–33
5. Cai, J., Fürer, M., Immerman, N.: An optimal lower bound for the number of variables for graph identification.Combinatorica 12 (1992) 389–410
6. Furst, M., Hopcroft, J., Luks, E.: Polynomial time algorithms for permutation groups.In: Proc.21st IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press (1980) 36–41
7. Hopcroft, J.E., Tarjan, R.E.: A V 2 algorithm for determining isomorphism of planar graphs.Information Processing Letters 1 (1971) 32–34
8. Immerman, N., Lander, E.: Describing graphs: a first order approach to graph canonization. In Selman, A.L., ed.: Complexity Theory Retrospective. Springer-Verlag, Berlin Heidelberg New York (1990) 59–81
9. Jenner, B., McKenzie, P., Torán, J.: A note on the hardness of tree isomorphism. In: Proc.13th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press (1998) 101–106
10. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Boston (1993)
11. Lewis, H., Papadimitriou, C.: Symmetric space-bounded computation. Theoretical Computer Science 19 (1982) 161–187
12. Lindell, S.: A logspace algorithm for tree canonization. In: Proc.24th ACM Symposium on Theory of Computing, ACM Press (1992) 400–404
13. 13. Lozano, A., Torán, J.: On the non-uniform complexity of the graph isomorphism problem. In Ambos-Spies, K., Homer, S., Schöning, U., eds.: Complexity Theory, Current Research. Cambridge University Press (1993) 245–273 (also in Proceedings of the 7th Structure in Complexity Theory Conference, 118–129, 1992).
14. 14. Luks, E.: Isomorphism of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences 25 (1982) 42–65
15. 15. Luks, E.: Parallel algorithms for permutation groups and graph isomorphism. In: Proc.27th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press (1986) 292–302
16. 16. Nisan, N., Ta-Shma, A.: Symmetric logspace is closed under complement. In: Proc. 27th ACM Symposium on Theory of Computing, ACM Press (1995) 140–146
17. 17. Torán, J.: On the hardness of graph isomorphism. In: Proc. 41st IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press (2000) 180–186