Empowering GNNs via Edge-Aware Weisfeiler-Leman Algorithm
Not on the map. Why?
Abstract (arXiv)
Message passing graph neural networks (GNNs) are known to have their expressiveness upper-bounded by 1-dimensional Weisfeiler-Leman (1-WL) algorithm. To achieve more powerful GNNs, existing attempts either require ad hoc features, or involve operations that incur high time and space complexities. In this work, we propose a general and provably powerful GNN framework that preserves the scalability of the message passing scheme. In particular, we first propose to empower 1-WL for graph isomorphism test by considering edges among neighbors, giving rise to NC-1-WL. The expressiveness of NC-1-WL is shown to be strictly above 1-WL and below 3-WL theoretically. Further, we propose the NC-GNN framework as a differentiable neural version of NC-1-WL. Our simple implementation of NC-GNN is provably as powerful as NC-1-WL. Experiments demonstrate that our NC-GNN performs effectively and efficiently on various benchmarks.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 48 of its 68 references that are in the map. First posted on arXiv 4 Jun 2022.
Builds on
48 of 68 references.
References · 48
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2017Deep Setscited by 1,394
- 2019Strategies for Pre-training Graph Neural Networkscited by 964
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
- 2015Gated Graph Sequence Neural Networkscited by 792
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
36 more
- 2020Benchmarking Graph Neural Networkscited by 672
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2019Provably Powerful Graph Networkscited by 385
- 2018Invariant and Equivariant Graph Networkscited by 339
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2020SIGN: Scalable Inception Graph Neural Networkscited by 283
- 2015Diffusion-Convolutional Neural Networkscited by 268
- 2020Can Graph Neural Networks Count Substructures?cited by 235
- 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 219
- 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
- 2021Identity-aware Graph Neural Networkscited by 197
- 2022Structure-Aware Transformer for Graph Representation Learningcited by 191
- 2020The Surprising Power of Graph Neural Networks with Random Node Initializationcited by 190
- 2020Random Features Strengthen Graph Neural Networkscited by 184
- 2019On the equivalence between graph isomorphism testing and function approximation with GNNscited by 172
- 2021Equivariant Subgraph Aggregation Networkscited by 154
- 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
- 2019Relational Pooling for Graph Representationscited by 150
- 2021Nested Graph Neural Networkscited by 136
- 2021Weisfeiler and Leman go Machine Learning: The Story so farcited by 121
- 2021DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networkscited by 117
- 2021Global Self-Attention as a Replacement for Graph Convolutioncited by 113
- 2020A Survey on The Expressive Power of Graph Neural Networkscited by 111
- 2020Building powerful and equivariant graph neural networks with structural message-passingcited by 95
- 2022Decoupling the Depth and Scope of Graph Neural Networkscited by 94
- 2022How Powerful are K-hop Message Passing Graph Neural Networkscited by 90
- 2018MotifNet: a motif-based Graph Convolutional Network for directed graphscited by 63
- 2018On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Propertiescited by 63
- 2022Theory of Graph Neural Networks: Representation and Learningcited by 60
- 2019k-hop Graph Neural Networkscited by 57
- 2019Coloring graph neural networks for node disambiguationcited by 49
- 2022SpeqNets: Sparsity-aware Permutation-equivariant Graph Networkscited by 37
- 2021Ego-GNNs: Exploiting Ego Structures in Graph Neural Networkscited by 17
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Depth-Adaptive Graph Neural Networks via Learnable Bakry-'Emery Curvaturecited by 8
- 2025Message Passing on the Edge: Towards Scalable and Expressive GNNscited by 0
- 2026Invariant-Stratified Propagation for Expressive Graph Neural Networkscited by 0
- 2026Treatment Effect Estimation with Differentiated Networked Effect on Graph Datacited by 0
- 2026Treatment Effect Estimation with Differentiated Networked Effect on Graph Data23 May 2026
- 2026Invariant-Stratified Propagation for Expressive Graph Neural Networks2 Mar 2026
- 2025Message Passing on the Edge: Towards Scalable and Expressive GNNs15 Oct 2025
- 2025Depth-Adaptive Graph Neural Networks via Learnable Bakry-'Emery Curvature3 Mar 2025