Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applications in Babai's quasipolynomial-time isomorphism algorithm, practical isomorphism solvers, and algebraic graph theory. However, it also has surprising connections to other areas such as logic, proof complexity, combinatorial …