Abstract
Our starting point is the observation that if graphs in a class C have low descriptive complexity, then the isomorphism problem for C is solvable by a fast parallel algorithm. More precisely, we prove that if every graph in C is definable in a finite-variable first order logic with counting quantifiers within logarithmic quantifier depth, then Graph Isomorphism for C is in \({\rm TC^1}\subseteq\mbox{\rm NC\ensuremath{^{2}}}\). If no counting quantifiers are needed, then Graph Isomorphism for C is even in AC1. The definability conditions can be checked by designing a winning strategy for suitable Ehrenfeucht-Fraïssé games with a logarithmic number of rounds. The parallel isomorphism algorithm this approach yields is a simple combinatorial algorithm known as the Weisfeiler-Lehman (WL) algorithm.
Using this approach, we prove that isomorphism of graphs of bounded treewidth is testable in TC1, answering an open question from [9]. Furthermore, we obtain an AC1 algorithm for testing isomorphism of rotation systems (combinatorial specifications of graph embeddings). The AC1 upper bound was known before, but the fact that this bound can be achieved by the simple WL algorithm is new. Combined with other known results, it also yields a new AC1 isomorphism algorithm for planar graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Babai, L.: Moderately exponential bound for graph isomorphism. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 34–50. Springer, Heidelberg (1981)
Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, Ch. 27, pp. 1447–1540. Elsevier Publ., Amsterdam (1995)
Babai, L., Grigoryev, D., Yu., M.D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proc. of the 14th ACM Symp. on Theory of Computing, pp. 310–324 (1982)
Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proc. of the 15th ACM Symposium on Theory of Computing, pp. 171–183 (1983)
Bodlaender, H.L.: Polynomial algorithms for Graph Isomorphism and Chromatic Index on partial k-trees. J. Algorithms 11, 631–643 (1990)
Bohman, T., Frieze, A.: Łuczak, T., Pikhurko, O., Smyth, C., Spencer, J., Verbitsky, O.: The first order definability of trees and sparse random graphs. E-print (2005), http://arxiv.org/abs/math.CO/0506288
Boppana, R.B., Stad, H.J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25, 127–132 (1987)
Cai, J.-Y., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12, 389–410 (1992)
Chandrasekharan, N.: Isomorphism testing of k-trees is in NC, for fixed k. Inf. Process. Lett. 34, 283–287 (1990)
Del Greco, J.G., Sekharan, C.N., Sridhar, R.: Fast parallel reordering and isomorphism testing of k-trees. Algorithmica 32, 61–72 (2002)
Evdokimov, S., Karpinski, M., Ponomarenko, I.: On a new high dimensional Weisfeiler-Lehman algorithm. J. Algebraic Combinatorics 10, 29–45 (1999)
Evdokimov, S., Ponomarenko, I.: On highly closed cellular algebras and highly closed isomorphism. In: Electronic J. Combinatorics, vol. 6 (1999) #R18
Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: Proc. of the 12th ACM Symp. on Theory of Computing, pp. 236–243 (1980)
Grohe, M.: Fixed-point logics on planar graphs. In: Proc. of the Ann. Conf. on Logic in Computer Science, pp. 6–15 (1998)
Grohe, M.: Isomorphism testing for embeddable graphs through definability. In: Proc. of the 32nd ACM Ann. Symp. on Theory of Computing, pp. 63–72 (2000)
Grohe, M., Marino, J.: Definability and descriptive complexity on databases of bounded tree-width. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 70–82. Springer, Heidelberg (1998)
Grohe, M., Verbitsky, O.: Testing graph isomorphism in parallel by playing a game. E-print (2006), http://arxiv.org/abs/cs.CC/0603054
Hopcroft, J.E., Tarjan, R.E.: Isomorphism of planar graphs (working paper). In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations, pp. 131–152. Plenum Press, New York (1972)
Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: Proc. of the 6th ACM Symp. on Theory of Computing, pp. 172–184 (1974)
Immerman, N.: Descriptive complexity. Springer, Heidelberg (1999)
Jenner, B., Köbler, J., McKenzie, P., Torán, J.: Completeness Results for Graph Isomorphism. J. Comput. Syst. Sci. 66, 549–566 (2003)
Karp, R.M., Ramachandran, V.: Parallel algorithms for shared-memory machines. In: van Leeuwen, J. (ed.) Algorithms and complexity. Handbook of theoretical computer science, pp. 869–941. Elsevier Publ., Amsterdam (1990)
Kim, J.-H., Pikhurko, O., Spencer, J., Verbitsky, O.: How complex are random graphs in first order logic? In: Random Structures and Algorithms, vol. 26, pp. 119–145 (2005)
Lindell, S.: A logspace algorithm for tree canonization. In: Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pp. 400–404 (1992)
Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25 (1982) 42–65
Miller, G.L.: Isomorphism testing for graphs of bounded genus. In: Proc. of the 12th ACM Symp. on Theory of Computing, pp. 225–235 (1980)
Miller, G.L., Reif, J.H.: Parallel tree contraction. Part 2: further applications. SIAM J. Comput. 20, 1128–1147
Mohar, B., Thomassen, C.: Graphs on surfaces. The John Hopkins University Press (2001)
Pikhurko, O., Spencer, J., Verbitsky, O.: Succinct definitions in first order graph theory. Annals of Pure and Applied Logic 139, 74–109 (2006)
Pikhurko, O., Veith, H., Verbitsky, O.: First order definability of graphs: tight bounds on quantifier rank. Discrete Applied Mathematics (to appear)
Ponomarenko, I.N.: The isomorphism problem for classes of graphs that are invariant with respect to contraction. Computational Complexity Theory 3. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov 174, 147–177 (1988)
Ramachandran, V., Reif, J.: Planarity testing in parallel. J.Comput.Syst.Sci. 49, 517–561 (1994)
Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree-width. J.Algorithms 7, 309–322 (1986)
Schöning, U.: Graph isomorphism is in the low hierarchy. J. Comput.Syst.Sci. 37, 312–323 (1988)
Spencer, J.: The strange logic of random graphs. Springer, Heidelberg (2001)
Torán, J.: On the hardness of graph isomorphism. SIAM J.Comput. 33, 1093–1108 (2004)
Verbitsky, O.: The first order definability of graphs with separators via the Ehrenfeucht game. Theor.Comput.Sci. 343, 158–176 (2005)
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
Grohe, M., Verbitsky, O. (2006). Testing Graph Isomorphism in Parallel by Playing a Game. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_2
Download citation
DOI: https://doi.org/10.1007/11786986_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)