The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful
com...
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful
com...
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a powerful tool
f...
The k-dimensional Weisfeiler-Leman procedure (k-WL), which colors k-tupl...
As it is well known, the isomorphism problem for vertex-colored graphs w...
We investigate graph properties and parameters that are invariant under
...
Lubiw showed that several variants of Graph Isomorphism are NP-complete,...