1 paper · 1 filter
Oleg Verbitsky, Maksim Zhukovskii
It is well known that almost all graphs are canonizable by a simple combinatorial routine known as color refinement, also referred to as the 1-dimensional Weisfeiler-Leman algorith…