Fetching the paper…
Reading the bibliography…
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem.
On construction and identification of graphs
Boris Weisfeiler · 1976
Earlier work this paper cites.
Lectures on graph isomorphism
László Babai · 1979
Earlier work this paper cites.
Moderately exponential bound for graph isomorphism
László Babai · 1981
Earlier work this paper cites.
A nonfactorial algorithm for testing isomorphism of two graphs
Mark K. Goldberg · 1983
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.
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.
Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
Sergei Evdokimov, Ilia Ponomarenko, and Gottfried Tinhofer · 2000
Earlier work this paper cites.
Classification of primitive association schemes of order up to 22
Akihide Hanaki and Izumi Miyamoto · 2000
Earlier work this paper cites.
Weisfeiler-lehman refinement requires at least a linear number of iterations
Martin Fürer · 2001
Earlier work this paper cites.
Classification of association schemes of small order
Akihide Hanaki and Izumi Miyamoto · 2003
Earlier work this paper cites.
Pathwidth of cubic graphs and exact algorithms
Fedor V. Fomin and Kjartan Høie · 2005
Earlier work this paper cites.
The first order definability of graphs: Upper bounds for quantifier depth
Oleg Pikhurko, Helmut Veith, and Oleg Verbitsky · 2006
Earlier work this paper cites.
The power of counting logics on restricted classes of finite structures
Anuj Dawar and David Richerby · 2007
Earlier work this paper cites.
Logical complexity of graphs: A survey
Oleg Pikhurko and Oleg Verbitsky · 2009
Earlier work this paper cites.
On recognizing graphs by numbers of homomorphisms
Zdenek Dvorák · 2010
Cited alongside, same era.
Sherali-adams relaxations and indistinguishability in counting logics
Albert Atserias and Elitza N. Maneva · 2013
Cited alongside, same era.
Lower bounds for the isoperimetric numbers of random regular graphs
Brett Kolesnik and Nick Wormald · 2014
Cited alongside, same era.
Reduction techniques for graph isomorphism in the context of width parameters
Yota Otachi and Pascal Schweitzer · 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.
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.
Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky · 2021
Later among the works it cites.
Deep Weisfeiler Leman
Martin Grohe, Pascal Schweitzer, and Daniel Wiebking · 2021
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.
Canonisation and definability for graphs of bounded rank width
Martin Grohe and Daniel Neuen · 2023
Later among the works it cites.
The Weisfeiler-Leman dimension of distance-hereditary graphs
Alexander L. Gavrilyuk, Roman Nedela, and Ilia Ponomarenko · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Strongly sublinear separators and polynomial expansion
Zdenek Dvorák and Sergey Norin · 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.
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Martin Grohe · 2017
Cited alongside, same era.
Benchmark graphs for practical graph isomorphism
Daniel Neuen and Pascal Schweitzer · 2017
Cited alongside, same era.
Towards an isomorphism dichotomy for hereditary graph classes
Pascal Schweitzer · 2017
Cited alongside, same era.
Quantum and non-signalling graph isomorphisms
Albert Atserias, Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, and Antonios Varvitsiotis · 2018
Cited alongside, same era.
Continuing the Quest for a Logic Capturing Polynomial Time - Potential, Limitations, and Interplay of Current Approaches
Moritz Lichter · 2023
Later among the works it cites.
Weisfeiler and Leman go machine learning: The story so far
Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, and Karsten M. Borgwardt · 2023
Later among the works it cites.
On the Weisfeiler-Leman dimension of permutation graphs
Jin Guo, Alexander L Gavrilyuk, and Ilia Ponomarenko · 2024
Closest in time.
Bounding the Weisfeiler-Leman dimension via a depth analysis of I/R-trees
Sandra Kiefer and Daniel Neuen · 2024
Closest in time.
Choiceless polynomial time with witnessed symmetric choice
Moritz Lichter and Pascal Schweitzer · 2024
Closest in time.
On the Weisfeiler-Leman dimension of circulant graphs, 2024
Yulai Wu and Ilia Ponomarenko · 2024
Closest in time.
Computational complexity of the Weisfeiler-Leman dimension
Moritz Lichter, Simon Raßmann, and Pascal Schweitzer · 2025
Closest in time.