Daniel Neuen

activity

20162026

most citedThe Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

11 citations · 61 across the 16 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023

Isomorphism for Tournaments of Small Twin Width

Martin Grohe, Daniel Neuen

We prove that isomorphism of tournaments of twin width at most $k$ can be decided in time $k^{O (l o g k)} n^{O (1)}$ . This implies that the isomorphism problem for classes of tourname…

cs.DM2023

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements

Martin Grohe, Moritz Lichter, Daniel Neuen +1

The $k$ -dimensional Weisfeiler-Leman ( $k$ -WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applic…

cs.DS2023★ 3 cited

The Iteration Number of the Weisfeiler-Leman Algorithm

Martin Grohe, Moritz Lichter, Daniel Neuen

We prove new upper and lower bounds on the number of iterations the $k$ -dimensional Weisfeiler-Leman algorithm ( $k$ -WL) requires until stabilization. For $k \geq 3$ , we show that $…