Fetching the paper…
Reading the bibliography…
In this paper, we relate a beautiful theory by Lov\'asz with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensional generalization known as the Weisfeiler-Leman algorithm.
Operations with structures
László Lovász · 1967
Earlier work this paper cites.
Local and global properties in networks of processors (extended abstract)
Dana Angluin · 1980
Earlier work this paper cites.
Graph isomorphism and theorems of Birkhoff type
Gottfried Tinhofer · 1986
Earlier work this paper cites.
Describing graphs: A first-order approach to graph canonization
Neil Immerman and Eric Lander · 1990
Earlier work this paper cites.
A note on compact graphs
Gottfried Tinhofer · 1991
Earlier work this paper cites.
Lower bounds on Hilbert’s Nullstellensatz and propositional proofs
Paul Beame, Russell Impagliazzo, Jan Krajíček, Toniann Pitassi, and Pavel Pudlák · 1996
Earlier work this paper cites.
Lower bounds on Nullstellensatz proofs via designs
Samuel R. Buss · 1998
Earlier work this paper cites.
Which graphs are determined by their spectrum?
Edwin R. Van Dam and Willem H. Haemers · 2003
Earlier work this paper cites.
Thirty years of graph matching in pattern recognition
Donatello Conte, Pasquale Foggia, Carlo Sansone, and Mario Vento · 2004
Earlier work this paper cites.
The complexity of counting homomorphisms seen from the other side
Víctor Dalmau and Peter Jonsson · 2004
Cited alongside, same era.
On the maximum quadratic assignment problem
Viswanath Nagarajan and Maxim Sviridenko · 2009
Cited alongside, same era.
Graph kernels
S. V. N. Vishwanathan, Nicol N. Schraudolph, Risi Kondor, and Karsten M. Borgwardt · 2010
Cited alongside, same era.
Weisfeiler-lehman graph kernels
Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M. Borgwardt · 2011
Cited alongside, same era.
Approximate graph isomorphism
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, and Yadu Vasudev · 2012
Cited alongside, same era.
Large Networks and Graph Limits
László Lovász · 2012
Cited alongside, same era.
Limitations of algebraic approaches to graph isomorphism testing
Christoph Berkholz and Martin Grohe · 2015
Later among the works it cites.
Pebble games and linear equations
Martin Grohe and Martin Otto · 2015
Later among the works it cites.
Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth
Andreas Krebs and Oleg Verbitsky · 2015
Later among the works it cites.
Graph isomorphism in quasipolynomial time [extended abstract]
László Babai · 2016
Later among the works it cites.
The pebbling comonad in finite model theory
Samson Abramsky, Anuj Dawar, and Pengming Wang · 2017
Later among the works it cites.
Homomorphisms are a good basis for counting small subgraphs
Radu Curticapean, Holger Dell, and Dániel Marx · 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…
Albert Atserias and Elitza N. Maneva · 2013
Cited alongside, same era.
Sherali–Adams relaxations of graph isomorphism polytopes
Peter N. Malkin · 2014
Cited alongside, same era.
Color refinement and its applications
Martin Grohe, Kristian Kersting, Martin Mladenov, and Pascal Schweitzer
Cited in the paper.
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Martin Grohe · 2017
Later among the works it cites.
The descriptive complexity of solving linear equation systems and its applications
Martin Grohe and Wied Pakusa · 2017
Later among the works it cites.