Fetching the paper…
Reading the bibliography…
The Weisfeiler-Leman dimension of a graph $G$ is the least number $k$ such that the $k$-dimensional Weisfeiler-Leman algorithm distinguishes $G$ from every other non-isomorphic graph.
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.
The monotone and planar circuit value problems are log space complete for P
Leslie M. Goldschlager · 1977
Earlier work this paper cites.
Canonical labelling of graphs in linear average time
László Babai and Ludek Kucera · 1979
Earlier work this paper cites.
Monte-Carlo algorithms in graph isomorphism testing
László Babai · 1979
Earlier work this paper cites.
A subexponential algorithm for trivalent graph isomorphism
Merrick Furst, John Hopcroft, and Eugene M. Luks · 1980
Earlier work this paper cites.
Distinguishing vertices of random graphs
Béla Bollobás · 1982
Earlier work this paper cites.
Canonical labeling of regular graphs in linear average time
Ludek Kucera · 1987
Earlier work this paper cites.
Describing Graphs: A First-Order Approach to Graph Canonization
Neil Immerman and Eric S. Lander · 1990
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identification
Jin-yi Cai, Martin Fürer, and Neil Immerman · 1992
Earlier work this paper cites.
Graph searching and a min-max theorem for tree-width
Paul D. Seymour and Robin Thomas · 1993
Earlier work this paper cites.
A linear-time algorithm for finding tree-decompositions of small treewidth
Hans L. Bodlaender · 1996
Earlier work this paper cites.
Logical hierarchies in PTIME
Lauri Hella · 1996
Earlier work this paper cites.
A partial k -arboretum of graphs with bounded treewidth
Hans L. Bodlaender · 1998
Earlier work this paper cites.
Association schemes of small order
Kyoungah See and Sung Y. Song · 1998
Earlier work this paper cites.
Equivalence in finite-variable logics is complete for polynomial time
Martin Grohe · 1999
Earlier work this paper cites.
Definability and descriptive complexity on databases of bounded tree-width
Martin Grohe and Julian Mariño · 1999
Cited alongside, same era.
The power of counting logics on restricted classes of finite structures
Anuj Dawar and David Richerby · 2007
Cited alongside, same era.
Engineering an efficient canonical labeling tool for large and sparse graphs
Tommi A. Junttila and Petteri Kaski · 2007
Cited alongside, same era.
On recognizing graphs by numbers of homomorphisms
Zdenek Dvorák · 2010
Cited alongside, same era.
Conflict propagation and component recursion for canonical labeling
Tommi A. Junttila and Petteri Kaski · 2011
Cited alongside, same era.
Fixed-point definability and polynomial time on graphs with excluded minors
Martin Grohe · 2012
Cited alongside, same era.
An exponential lower bound for individualization-refinement algorithms for graph isomorphism
Daniel Neuen and Pascal Schweitzer · 2018
Later among the works it cites.
Lectures on Coherent Configurations
G. Chen and I. Ponomarenko · 2019
Later among the works it cites.
The Weisfeiler-Leman dimension of planar graphs is at most 3
Sandra Kiefer, Ilia Ponomarenko, and Pascal Schweitzer · 2019
Later among the works it cites.
Weisfeiler and Leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2019
Later among the works it cites.
Parallel computation of combinatorial symmetries
Markus Anders and Pascal Schweitzer · 2021
Later among the works it cites.
Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sherali-Adams relaxations and indistinguishability in counting logics
Albert Atserias and Elitza N. Maneva · 2013
Cited alongside, same era.
Practical graph isomorphism, II
Brendan D. McKay and Adolfo Piperno · 2013
Cited alongside, same era.
Choiceless polynomial time on structures with small abelian colour classes
Faried Abu Zaid, Erich Grädel, Martin Grohe, and Wied Pakusa · 2014
Cited alongside, same era.
Pebble games and linear equations
Martin Grohe and Martin Otto · 2015
Cited alongside, same era.
Graph isomorphism in quasipolynomial time [extended abstract]
László Babai · 2016
Cited alongside, same era.
Graph isomorphism, color refinement, and compactness
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, and Oleg Verbitsky · 2017
Cited alongside, same era.
Later among the works it cites.
Graphs identified by logics with counting
Sandra Kiefer, Pascal Schweitzer, and Erkal Selman · 2022
Later among the works it cites.
Treewidth is NP-complete on cubic graphs
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop, Paloma T. Lima, Martin Milanič, Sebastian Ordyniak, Sukanya Pandey, and Ondřej Suchý · 2023
Later among the works it cites.
Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements
Martin Grohe, Moritz Lichter, Daniel Neuen, and Pascal Schweitzer · 2023
Later among the works it cites.
Canonisation and definability for graphs of bounded rank width
Martin Grohe and Daniel Neuen · 2023
Later among the works it cites.
Separating rank logic from polynomial time
Moritz Lichter · 2023
Later among the works it cites.
Witnessed symmetric choice and interpretations in fixed-point logic with counting
Moritz Lichter · 2023
Later among the works it cites.
An upper bound on the Weisfeiler-Leman dimension, 2024
Thomas Schneider and Pascal Schweitzer · 2024
Closest in time.
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Tim Seppelt · 2024
Closest in time.