Graph isomorphism in quasipolynomial time [extended abstract]

  title={Graph isomorphism in quasipolynomial time [extended abstract]},
  author={L{\'a}szl{\'o} Babai},
  journal={Proceedings of the forty-eighth annual ACM symposium on Theory of Computing},
  • L. Babai
  • Published 19 June 2016
  • Mathematics, Computer Science
  • Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
We show that the Graph Isomorphism (GI) problem and the more general problems of String Isomorphism (SI) andCoset Intersection (CI) can be solved in quasipolynomial(exp((logn)O(1))) time. The best previous bound for GI was exp(O( √n log n)), where n is the number of vertices (Luks, 1983); for the other two problems, the bound was similar, exp(O~(√ n)), where n is the size of the permutation domain (Babai, 1983). Following the approach of Luks’s seminal 1980/82 paper, the problem we actually… 
Hypergraph Isomorphism for Groups with Restricted Composition Factors
An algorithm testing isomorphism of graphs excluding $K_{3,h}$ ($h \geq 3$) as a minor in time gives an isomorphicism test for graphs of Euler genus at most $g running in time $n^{O((\log g)^{c})}$.
Counting homomorphisms in plain exponential time
Wahlstrom proved that #GraphHom can be solved in plain exponential time, that is, in time k^{|V(G)|+V(H)|}\poly(|V (H)|, |V (G)|) provided H has clique width k.
Spectral Graph Isomorphism
A polynomial time algorithm that finds a nearly-optimal spectral isomorphism when the input graphs are bounded degree trees and an NP- hardness result for the GD problem and APX-hardness for optimization version of GD problem are presented.
Towards faster isomorphism tests for bounded-degree graphs
There is an n-isomorphism test for all classes of graphs of maximum degree d and diameter at most $O(\log n)$ and this implies that there is an $n^{\text{polylog}(d)}$- isomorphismTest for all families of $d$-regular expander graphs.
An Improved Isomorphism Test for Bounded-tree-width Graphs
A new fpt algorithm testing isomorphism of n-vertex graphs of tree width in time is given, which avoids the use of Babai's algorithm and has the additional benefit that it can also used as a canonization algorithm.
The query complexity of graph isomorphism: bypassing distribution testing lower bounds
An algorithm is given that makes n1+o(1) queries, improving on the previous best bound of Õ(n5/4), and is optimal up to a subpolynomial factor.
Isomorphism Testing Parameterized by Genus and Beyond
(t, k)-WL-bounded graphs are introduced which provide a powerful tool to combine group-theoretic techniques with the standard Weisfeiler-Leman algorithm and are of independent interest.
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
We prove that Graph Isomorphism and Canonization in graphs excluding a fixed graph H as a minor can be solved by an algorithm working in time f(H)· nO(1), where f is some function. In other words, we
Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erdős-Rényi Model
  • Yinan Li, Youming Qiao
  • Mathematics, Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
An average-case efficient algorithm for the alternating matrix space isometry problem over a key range of parameters, in a random model of alternating matrix spaces in vein of the Erd∝os-R´enyi model of random graphs is devised, and a linear algebraic analogue of the classical individualisation technique is developed.
Graph Isomorphism Restricted by Lists
It is proved that when GraphIso is GI-complete for a class of graphs, it translates into NP-completeness of ListIso, and that no robust algorithm for cubic graph isomorphism exists, unless P = NP.


Faster Canonical Forms for Strongly Regular Graphs
We show that a canonical form for strongly regular (s. r.) graphs can be found in time exp(Õ(n1/5))and therefore isomorphism of s. r. graphs can be tested within the same time bound, where n is the
Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs
It is shown that there are pairs of nonisomorphic n-vertex graphs G and H such that any sum-of-squares (SOS) proof of non isomorphism requires degree Ω(n), and an O(n)-round integrality gap for the Lasserre SDP relaxation is shown.
A Note on the Graph Isomorphism counting Problem
Monte-Carlo algorithms in graph isomorphism testing
Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for color-preserving isomorphism. We are also able to generate uniformly
Code equivalence and group isomorphism
A more hopeful program to find a polynomial-time algorithm for semisimple groups, defined as groups without abelian normal subgroups, is initiated and it is proved that the isomorphism problem for this class can be solved in time nO(log log n).
On the Order of Uniprimitive Permutation Groups
One of the central problems of 19th century group theory was the estimation of the order of a primitive permutation group G of degree n, where G X An. We prove I G I < exp (4V'/ n log2 n) for the
Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract
A new combinatorial structure theory for PCCs is developed that in particular demonstrates the presence of "asymptotically uniform clique geometries" among the constituent graphs of P CCs in a certain range of the parameters.
Graph Isomorphism and the Lasserre Hierarchy
The main result rules out this promising direction by showing that even Omega(n) rounds of the Lasserre semidefinite program hierarchy fail to solve the Graph Isomorphism problem even on expander graphs.
Hypergraph isomorphism and structural equivalence of Boolean functions
  • E. Luks
  • Mathematics, Computer Science
    STOC '99
  • 1999
It is shown that hypergraph isomorphism can be tested in time O(c”), where n is the sire of the vertex set, and an NC test of equivalence of truth tables under permutation of variables alone is obtained.
Asymptotic Delsarte cliques in distance-regular graphs
We give a new bound on the parameter $$\lambda $$λ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph G, improving and generalizing bounds for strongly regular