11 citations · 61 across the 16 of their papers we have counts for
4 papers · 1 filter
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables…
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
Martin Grohe, Moritz Lichter, Daniel Neuen +1
The -dimensional Weisfeiler-Leman (-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applic…
A Study of Weisfeiler-Leman Colorings on Planar Graphs
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- a…
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Mean…