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 cs.CCShow all

1 paper · 1 filter

cs.CC2017

An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism

Daniel Neuen, Pascal Schweitzer

The individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers a…