Fetching the paper…
Reading the bibliography…
The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a fruitful approach to the Graph Isomorphism problem.
On linear associative algebras corresponding to association schemes of partially balanced designs
R. C. Bose and D. M. Mesner · 1959
Earlier work this paper cites.
Finite permutation groups of rank 3
D. Higman · 1964
Earlier work this paper cites.
The generation of a unique machine description for chemical structures — a technique developed at chemical abstracts service
H. L. Morgan · 1965
Earlier work this paper cites.
The reduction of a graph to canonical form and the algebra which appears therein
B. Weisfeiler and A. Leman · 1968
Earlier work this paper cites.
Random graph isomorphism
L. Babai, P. Erdős, and S. M. Selkow · 1980
Earlier work this paper cites.
Reduction to NP-complete problems by interpretations
E. Dahlhaus · 1984
Earlier work this paper cites.
On matching coefficients
E. J. Farrell, J. M. Guo, and G. M. Constantine · 1991
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identifications
J. Cai, M. Fürer, and N. Immerman · 1992
Earlier work this paper cites.
Fractional isomorphism of graphs
M. V. Ramana, E. R. Scheinerman, and D. Ullman · 1994
Earlier work this paper cites.
Logical hierarchies in PTIME
L. Hella · 1996
Earlier work this paper cites.
Fractional graph theory. A rational approach to the theory of graphs
E. R. Scheinerman and D. H. Ullman · 1997
Earlier work this paper cites.
A restricted second order logic for finite structures
A. Dawar · 1998
Earlier work this paper cites.
Descriptive complexity
N. Immerman · 1999
Earlier work this paper cites.
Models of random regular graphs
N. Wormald · 1999
Earlier work this paper cites.
The matching polynomial of a distance-regular graph
R. A. Beezer and E. J. Farrell · 2000
Earlier work this paper cites.
Graph theory
R. Diestel · 2000
Cited alongside, same era.
Random graphs
B. Bollobás · 2001
Cited alongside, same era.
Network motifs: Simple building blocks of complex networks
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon · 2002
Cited alongside, same era.
The structure and function of complex networks
M. E. J. Newman · 2003
Cited alongside, same era.
Network motif discovery using subgraph enumeration and symmetry-breaking
J. A. Grochow and M. Kellis · 2007
Cited alongside, same era.
Affine systems of equations and counting infinitary logic
A. Atserias, A. A. Bulatov, and A. Dawar · 2009
Cited alongside, same era.
On the parameterized complexity of multiple-interval graph problems
Large connected strongly regular graphs are Hamiltonian
L. Pyber · 2014
Later among the works it cites.
Solving linear programs without breaking abstractions
M. Anderson, A. Dawar, and B. Holm · 2015
Later among the works it cites.
The nature and power of fixed-point logic with counting
A. Dawar · 2015
Later among the works it cites.
Graphs identified by logics with counting
S. Kiefer, P. Schweitzer, and E. Selman · 2015
Later among the works it cites.
Graph isomorphism in quasipolynomial time
L. Babai · 2016
Later among the works it cites.
Graph isomorphism, color refinement, and compactness
V. Arvind, J. Köbler, G. Rattan, and O. Verbitsky · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. R. Fellows, D. Hermelin, F. A. Rosamond, and S. Vialette · 2009
Cited alongside, same era.
On the power of combinatorial and spectral invariants
M. Fürer · 2010
Cited alongside, same era.
Weisfeiler-Lehman graph kernels
N. Shervashidze, P. Schweitzer, E. J. van Leeuwen, K. Mehlhorn, and K. M. Borgwardt · 2011
Cited alongside, same era.
Fixed-point definability and polynomial time on graphs with excluded minors
M. Grohe · 2012
Cited alongside, same era.
Large Networks and Graph Limits
L. Lovász · 2012
Cited alongside, same era.
On the resolution complexity of graph non-isomorphism
J. Torán · 2013
Cited alongside, same era.
Homomorphisms are a good basis for counting small subgraphs
R. Curticapean, H. Dell, and D. Marx · 2017
Later among the works it cites.
Pebble games and cospectral graphs
A. Dawar, S. Severini, and O. Zapata · 2017
Later among the works it cites.
On the combinatorial power of the Weisfeiler-Lehman algorithm
M. Fürer · 2017
Later among the works it cites.
Testing for global network structure using small subgraph statistics
C. Gao and J. Lafferty · 2017
Later among the works it cites.
Glocalized Weisfeiler-Lehman graph kernels: Global-local feature maps of graphs
C. Morris, K. Kersting, and P. Mutzel · 2017
Later among the works it cites.
Lovász meets Weisfeiler and Leman
H. Dell, M. Grohe, and G. Rattan · 2018
Closest in time.
Triangle counting in large networks: a review
M. A. Hasan and V. S. Dave · 2018
Closest in time.
Weisfeiler and Leman go neural: Higher-order graph neural networks
C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe · 2018
Closest in time.