1 citations · 1 across the 1 of their papers we have counts for
1 paper
Thomas Schneider, Pascal Schweitzer
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory a…