Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66 (2003) 549-566] (DOI:10.1016/S0022-0000(03)00042-4);Completeness results for graph isomorphism

Journal of Computer and System Sciences

Volumn 66, Issue 3, 2003, Pages 549-566

  Jenner, Birgit ^a   Köbler, Johannes ^b   McKenzie, Pierre ^c   Torán, Jacobo ^a  

^a UNIVERSITY OF ULM   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

COLORED GRAPHS; GRAPH ISOMORPHISM;

GRAPH THEORY;

EID: 0038575673     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.11.002     Document Type: Erratum

References (28)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. C. Álvarez, R. Greenlaw, A compendium of problems complete for symmetric logarithmic space, J. Comput. Complexity 9 (2000) 73-95.
3. L. Babai, Monte Carlo algorithms, for graph isomorphism testing, Technical Report 79-10, Dep. Math. Stat., Univ. de Montréal, 1979.
4. L. Babai, Moderately exponential bounds for graph isomorphism, in: Proceedings of the International Symposium on Fundamentals of Computing Theory 81, Lecture Notes in Computer Science, Vol. 117, Springer, Berlin, Heidelberg, New York, 1981, pp. 34-50.
5. 1. J. Comput. System Sci. 38 (1989) 150-164.
6. 1, J. Comput. System Sci. 41 (1990) 274-306.
7. M. Beaudry, P. McKenzie, Circuits, matrices and nonassociative computation, J. Comput. System Sci. 50 (3) (1995) 441-455.
8. S.R. Buss, Algorithms for Boolean formula evaluation and for tree contraction, in: P. Clote and J. Krajicek (Eds.), Proof Theory, Complexity, and Arithmetic, Oxford University Press, 1993, pp. 95-115.
9. S. Buss, Alogtime algorithms for tree isomorphism, comparison, and canonization, in: Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium'97, Lecture Notes in Computer Science, Vol. 1289, Springer, Berlin, Heidelberg, New York, 1997, pp. 18-33.
10. J. Cai, M. Fürer, N. Immerman, An optimal lower bound for the number of variables for graph identification, Combinatorica 12 (1992) 389-410.
11. R. Chang, J. Kadin, On computing boolean connectives of characteristic functions, Math. Systems Theory 28 (1995) 173-198.
12. S.A. Cook, P. McKenzie, Problems complete for deterministic logarithmic space, J. Algorithms 8 (1987) 385-394.
13. K. Etessami, Counting quantifiers, successor relations, and logarithmic space, in: Proceedings of the 10th Structure in Complexity Theory Conference, IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 2-11.
14. M. Frust, J. Hopcroft, E. Luks, Polynomial time algorithms for permutations groups, in: Proceedings of the 21st IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1980, pp. 36-41.
15. 2 algorithm for determining isomorphism of planar graphs, Inform. Process. Lett. 1 (1971) 32-34.
16. N. Immerman, E. Lander, Describing graphs: a first order approach to graph canonization, in: A.L. Selman (Ed.), Complexity Theory Retrospective, Springer, Berlin, Heidelberg, New York, 1990, pp. 59-81.
17. B. Jenner, P. McKenzie, J. Torán, A note on the hardness of tree isomorphism, in: Proceedings of the 13th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1998, pp. 101-106.
18. J. Köbler, U. Schöning, J. Torán, The Graph Isomorphism Problem: Its Structural Complexity, Birkhäuser, Boston, 1993.
19. J. Köbler, J. Torán, The complexity of graph isomorphism for colored graphs with color classes of size 2 and 3. in: Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 2285, Springer, Berlin, Heidelberg, New York, 2002, pp. 121-132.
20. H. Lewis, C. Papadimitriou, Symmetric space-bounded computation, Theoret. Comput. Sci. 19 (1982) 161-187.
21. S. Lindell, A logspace algorithm for tree canonization, in: Proceedings of the 24th ACM Symposium on Theory of Computing, ACM Press, New York, 1992, pp. 400-404.
22. A. Lozano, J. Torán, On the nonuniform complexity of the graph isomorphism problem, in: K. Ambos-Spies, S. Homer, U. Schöning (Eds.), Complexity Theory, Current Research. Cambridge University Press, Cambridge, MA, 1993, pp. 245-273
23. A. Lozano, J. Torán, On the nonuniform complexity of the graph isomorphism problem, Proceedings of the Seventh Structure in Complexity Theory Conference, June 1992, pp. 118-129.
24. E. Luks, Isomorphism of bounded valence can be tested in polynomial time, J. Comput. System Sci. 25 (1982) 42-65.
25. E. Luks, Parallel algorithms for permutation groups and graph isomorphism, in: Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1986, pp. 292-302.
26. G. Miller, J. Reif, Parallel tree contraction part 2: further applications. SIAM J. Comput. 20 (1991) 1128-1147.
27. N. Nisan, A. Ta-Shma, Symmetric logspace is closed under complement, in: Proceedings of the 27th ACM Symposium on Theory of Computing, ACM Press, New York, 1995, pp. 140-146, appeared also in Chicago J. Theoret. Comput. Sci. 1, 1995.
28. J. Torán, On the hardness of graph isomorphism, in: Proceedings of the 41st IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2000, pp. 180-186.