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.
Message passing treats meshes and point clouds as graphs where nodes exchange information with neighbors to learn useful features.