5 citations · 6 across the 3 of their papers we have counts for
1 paper · 2 filters
Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
The k-dimensional Weisfeiler-Leman algorithm is a powerful tool in graph isomorphism testing. For an input graph G, the algorithm determines a canonical coloring of s-tuples…