Search Space Contraction in Canonical Labeling of Graphs

Difference sets in a finite group

R. H. Bruck · 1955

Earlier work this paper cites.

Computation with permutation groups

Charles C. Sims · 1971

Earlier work this paper cites.

A v log v algorithm for isomorphism of triconnected planar graphs

John E. Hopcroft and Robert E. Tarjan · 1973

Earlier work this paper cites.

Linear time algorithm for isomorphism of planar graphs (preliminary report)

J. E. Hopcroft and J. K. Wong · 1974

Earlier work this paper cites.

On Construction and Identification of Graphs

Original

Boris Weisfeiler · 1976

Earlier work this paper cites.

On the nlog n isomorphism technique (a preliminary report)

Gary L. Miller · 1978

Earlier work this paper cites.

Monte Carlo algorithms in graph isomorphism testing

László Babai · 1979

Earlier work this paper cites.

Permutation Groups and Combinatorial Structures

N. L. Biggs and A. T. White · 1979

Earlier work this paper cites.

A note on the graph isomorphism counting problem

Rudolf Mathon · 1979

Earlier work this paper cites.

A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus

I. S. Filotti and Jack N. Mayer · 1980

Earlier work this paper cites.

Moderately exponential bound for graph isomorphism

László Babai · 1981

Cited alongside, same era.

Practical graph isomorphism

Brendan D. McKay · 1981

Cited alongside, same era.

Isomorphism of graphs with bounded eigenvalue multiplicity

László Babai, D. Yu. Grigoryev, and David M. Mount · 1982

Cited alongside, same era.

Isomorphism of graphs of bounded valence can be tested in polynomial time

Eugene M. Luks · 1982

Cited alongside, same era.

Canonical labeling of graphs

László Babai and Eugene M. Luks · 1983

Cited alongside, same era.

Graph isomorphism is in the low hierarchy

Uwe Schöning · 1988

Cited alongside, same era.

An optimal lower bound on the number of variables for graph identifications

The complexity of McKay’s canonical labeling algorithm

Takunari Miyazaki · 1997

Later among the works it cites.

Combinatorial Algorithms: generation, enumeration, and search

Donald L. Kreher and Douglas Robert Stinson · 1999

Later among the works it cites.

Stabilization Procedures and Applications

O. Bastert · 2001

Later among the works it cites.

Coherent configurations, association schemes and permutation groups

Peter J. Cameron · 2003

Later among the works it cites.

Permutation group algorithms

Ákos Seress · 2003

Later among the works it cites.

Exploiting structure in symmetry detection for cnf

Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah, and Igor L. Markov · 2004

Later among the works it cites.