# Random Graph Isomorphism

@article{Babai1980RandomGI, title={Random Graph Isomorphism}, author={L{\'a}szl{\'o} Babai and Paul Erd{\"o}s and Stanley M. Selkow}, journal={SIAM J. Comput.}, year={1980}, volume={9}, pages={628-635} }

A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but $o(2^{( \begin{subarray}{l} n \\ 2 \end{subarray} )} )$) of the $2^{( \begin{subarray}{l} n \\ 2 \end{subarray} )} $ graphs on n vertices). Hence, for almost all graphs X, any graph Y can be easily tested for isomorphism to X by an extremely naive linear time algorithm. This result is based on the following: In almost all graphs on n vertices, the largest $n^{0.15} $ degrees are…

## 280 Citations

Efficient random graph matching via degree profiles

- Computer Science, MathematicsProbability Theory and Related Fields
- 2020

This work develops an O ~ ( n d 2 + n 2 ) -time algorithm which perfectly recovers the true vertex correspondence with high probability, provided that the average degree is at least d = \varOmega (\log ^2 n) and the two graphs differ by at most d = O ( log - 2 ( n) ) fraction of edges.

Graph Isomorphism for Bounded Genus Graphs In Linear Time

- MathematicsArXiv
- 2015

This work improves previously known algorithms whose time complexity is $n^{O(g)}$ and is the first fixed-parameter tractable algorithm for the graph isomorphism problem for bounded genus graphs in terms of the Euler genus.

On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs

- Computer Science, MathematicsArXiv
- 2018

This work identifies a region in which a straightforward $O(n^2\log n)$-time canonical labeling algorithm, initially introduced in the context of graph isomorphism, succeeds in matching correlated Erd\H{o}s-R\'enyi graphs.

Graph Isomorphism, Color Refinement, and Compactness

- Mathematics, Computer Sciencecomputational complexity
- 2016

It is shown that all amenable graphs are compact, and it is proved that recognizing each of these graph classes is P-hard, which gives a first complexity lower bound for recognizing compact graphs.

Completely Positive formulation of the Graph Isomorphism Problem

- MathematicsArXiv
- 2013

The completely-positive Lov\'asz $\vartheta$ function is considered and it is shown that the function evaluates to n whenever G_1 and G_2 are isomorphic and to less than $n-1/(4n^4)$ when non-isomorphic.

A Geometric Approach to Graph Isomorphism

- MathematicsISAAC
- 2014

An algorithm for GI is presented and it is proved that it detects non-isomorphism in polynomial time if the solution of the LP violates any of the known facets of the convex hull of the solution points of IP.

An Annotated Glossary of Graph Theory Parameters, with Conjectures

- Mathematics
- 2018

This glossary contains an annotated listing of some 300 parameters of graphs, together with their definitions, and, for most of these, a reference to the authors who introduced them. Let G = (V, E)…

Moderately Exponential Bound for Graph Isomorphism

- MathematicsFCT
- 1981

The first significant complexity result in graph isomorphism testing was the linear time canonical labeling of trees, found by Hopcroft and Tarjan [16~, and independently by V.N. Zemlyachenko [29].…

Testing Graph Isomorphism in Parallel by Playing a Game

- Mathematics, Computer ScienceICALP
- 2006

It is proved 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 TC1, and an AC1 algorithm for testing isomorphism of rotation systems (combinatorial specifications of graph embeddings).

## References

SHOWING 1-9 OF 9 REFERENCES

Canonical labelling of graphs in linear average time

- Mathematics20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
- 1979

It is proved that a simple vertex classification procedure results after only two refinement steps in a CL of random graphs with probability 1 - exp(-cn), and a linear time CL algorithm is obtained with only exp (-cn log n/log log n) probability of failure.

BoLLOBás, Degree sequences of random graphs

- Aarhus University,
- 1978

Probabilistic analysis of a canonical numbering algorithm for graphs

- Proc . Symposia in Pure Math
- 1979

Probabilistic Methods in Combinatorics, Akadémiai Kiadó

- Probabilistic Methods in Combinatorics, Akadémiai Kiadó
- 1974

The beacon set approach to graph isomorphism

- 1978

The particular corollary to Theorem 3 .6, that the vertex having maximum degree is unique in almost all graphs

The fast approximate solution of hard combinatorial problems

- Proc. 6th South-Eastern Conf . Combinatorics, Graph Theory and Computing (Florida Atlantic U
- 1975