Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width

Panagiotis Aivasiliotis, Andreas Göbel, Matthias Lanzinger +1

The Weisfeiler--Leman (WL) algorithm is one of the most influential heuristics for the graph isomorphism problem. The expressive power of WL has been extensively studied in the con…