11 citations · 61 across the 16 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DM2019★ 11 cited
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…
cs.DS2019★ 7 cited
Canonisation and Definability for Graphs of Bounded Rank Width
Martin Grohe, Daniel Neuen
We prove that the combinatorial Weisfeiler-Leman algorithm of dimension is a complete isomorphism test for the class of all graphs of rank width at most . Rank width is…