Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm

As it is well known, the isomorphism problem for vertex-colored graphs with color multiplicity at most 3 is solvable by the classical 2-dimensional Weisfeiler-Leman algorithm (2-WL). On the other hand, the prominent Cai-Furer-Immerman construction shows that even the multidimensional version of the algorithm does not suffice for graphs with color multiplicity 4. We give an efficient decision procedure that, given a graph $G$ of color multiplicity 4, recognizes whether or not $G$ is identifiable by 2-WL, that is, whether or not 2-WL distinguishes $G$ from any non-isomorphic graph. In fact, we solve the much more general problem of recognizing whether or not a given coherent configuration of maximum fiber size 4 is separable. This extends our recognition algorithm to graphs of color multiplicity 4 with directed and colored edges. Our decision procedure is based on an explicit description of the class of graphs with color multiplicity 4 that are not identifiable by 2-WL. The Cai-Furer-Immerman graphs of color multiplicity 4 distinctly appear here as a natural subclass, which demonstrates that the Cai-Furer-Immerman construction is not ad hoc. Our classification reveals also other types of graphs that are hard for 2-WL. One of them arises from patterns known as $(n_3)$-configurations in incidence geometry.

[1]  Mikhail H. Klin,et al.  A non-Schurian coherent configuration on 14 points exists , 2017, Des. Codes Cryptogr..

[2]  Vikraman Arvind,et al.  Bounded color multiplicity graph isomorphism is in the #L hierarchy , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[3]  Saharon Shelah,et al.  On finite rigid structures , 1994, Journal of Symbolic Logic.

[4]  Lap Chi Lau,et al.  Fast matrix rank algorithms and applications , 2012, JACM.

[5]  Brendan D. McKay,et al.  Graph Isomorphism , 2016, Encyclopedia of Algorithms.

[6]  Daniel Neuen,et al.  An exponential lower bound for individualization-refinement algorithms for graph isomorphism , 2017, STOC.

[7]  Tomaž Pisanski,et al.  Configurations from a Graphical Viewpoint , 2012, Ars Math. Contemp..

[8]  D. G. Higman.  Finite permutation groups of rank 3 , 1964 .

[9]  Daniel Neuen,et al.  Benchmark Graphs for Practical Graph Isomorphism , 2017, ESA.

[10]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[11]  A. A. LEMAN,et al.  THE REDUCTION OF A GRAPH TO CANONICAL FORM AND THE ALGEBRA WHICH APPEARS THEREIN , 2018 .

[12]  Carme Àlvarez,et al.  A Very Hard log-Space Counting Class , 1993, Theor. Comput. Sci..

[13]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[14]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[15]  László Babai,et al.  Graph isomorphism in quasipolynomial time [extended abstract] , 2015, STOC.

[16]  Martin Fürer,et al.  On the Combinatorial Power of the Weisfeiler-Lehman Algorithm , 2017, CIAC.

[17]  Vikraman Arvind,et al.  On Hypergraph and Graph Isomorphism with Bounded Color Classes , 2006, STACS.

[18]  Christoph Meinel,et al.  Structure and importance of logspace-MOD class , 1992, Mathematical systems theory.

[19]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[20]  Oscar H. Ibarra,et al.  A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications , 1982, J. Algorithms.

[21]  Mikhail E. Muzychuk,et al.  On Quasi-thin Association Schemes , 2002, J. Comb. Theory, Ser. A.

[22]  Pascal Schweitzer,et al.  Graphs Identified by Logics with Counting , 2015, MFCS.

[23]  Kijung Kim,et al.  Schurity and separability of quasiregular coherent configurations , 2018, Journal of Algebra.

[24]  J. Hopcroft,et al.  Triangular Factorization and Inversion by Fast Matrix Multiplication , 1974 .

[25]  Branko Grünbaum,et al.  Configurations of Points and Lines , 2009 .

[26]  Sergei Evdokimov,et al.  On Highly Closed Cellular Algebras and Highly Closed Isomorphisms , 1998, Electron. J. Comb..

[27]  Klaus Metsch,et al.  Linear spaces with few lines , 1991, Discret. Math..

[28]  Anuj Dawar,et al.  Constructing Hard Examples for Graph Isomorphism , 2019, J. Graph Algorithms Appl..

[29]  F. Buekenhout.  An Introduction to Incidence Geometry , 1995 .

[30]  Gottfried Tinhofer,et al.  Forestal algebras and algebraic forests (on a new class of weakly compact graphs) , 2000, Discret. Math..

[31]  B. Bollobás.  Distinguishing Vertices of Random Graphs , 1982 .

[32]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[33]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[34]  Eugene M. Luks,et al.  Parallel algorithms for permutation groups and graph isomorphism , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[35]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[36]  Oleg Verbitsky,et al.  Graph Isomorphism, Color Refinement, and Compactness , 2015, computational complexity.

[37]  R. C. Bose,et al.  On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs , 1959 .