heterophilic graphs
- Coloring Learning for Heterophilic Graph Representation
- Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation Models
- GAMMA: Gated Multi-hop Message Passing for Homophily-Agnostic Node Representation in GNNs
- One Prompt Fits All: Universal Graph Adaptation for Pretrained Models