Groups
Category
The Weisfeiler–Leman (WL) hierarchy is a family of color-refinement procedures that iteratively color vertices (or k-tuples of vertices) to capture graph structure for isomorphism testing.
Graph Neural Networks (GNNs) learn on graphs by repeatedly letting each node aggregate messages from its neighbors and update its representation.