Canonical labeling of regular graphs in linear average time

An algorithm is presented to compute a canonical form of regular graphs. There is a constant c such that for each constant d the average running time of the algorithm over all d-regular graphs with N vertices is not greater than cNd, provided N is sufficiently large.

[1]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

[2]  Zvi Galil,et al.  An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[4]  Nicholas C. Wormald,et al.  The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[5]  László Babai,et al.  Computational complexity and the classification of finite simple groups , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[7]  Martin Fürer,et al.  Normal forms for trivalent graphs and graphs of bounded valence , 1983, STOC.

[8]  László Babai,et al.  Canonical labelling of graphs in linear average time , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Ludek Kucera.  An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs , 1985, STACS.

[12]  Béla Bollobás,et al.  The diameter of random regular graphs , 1982, Comb..

[13]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[14]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .