Fetching the paper…
Reading the bibliography…
The ability of graph neural networks (GNNs) to count certain graph substructures, especially cycles, is important for the success of GNNs on a wide range of tasks.
The reduction of a graph to canonical form and the algebra which appears therein
Boris Weisfeiler and Andrei Leman · 1968
Earlier work this paper cites.
An optimal lower bound on the number of variables for graph identification
Jin-Yi Cai, Martin Fürer, and Neil Immerman · 1992
Earlier work this paper cites.
Finding and counting given length cycles
Noga Alon, Raphael Yuster, and Uri Zwick · 1997
Earlier work this paper cites.
Automated approaches for classifying structures
Mukund Deshpande, Michihiro Kuramochi, and George Karypis · 2002
Earlier work this paper cites.
An efficient algorithm for detecting frequent subgraphs in biological networks
Mehmet Koyutürk, Ananth Grama, and Wojciech Szpankowski · 2004
Earlier work this paper cites.
Finding frequent subgraphs in longitudinal social network data using a weighted graph mining approach
Chuntao Jiang, Frans Coenen, and Michele Zito · 2010
Earlier work this paper cites.
Pebble games and linear equations
Martin Grohe and Martin Otto · 2015
Earlier work this paper cites.
Semi-supervised classification with graph convolutional networks
Thomas N Kipf and Max Welling · 2016
Earlier work this paper cites.
Xavier Bresson and Thomas Laurent · 2017
Earlier work this paper cites.
On the combinatorial power of the weisfeiler-lehman algorithm
Martin Fürer · 2017
Earlier work this paper cites.
Neural message passing for quantum chemistry
Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl · 2017
Earlier work this paper cites.
Attention is all you need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin · 2017
Earlier work this paper cites.
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio · 2017
Earlier work this paper cites.
Junction tree variational autoencoder for molecular graph generation
Wengong Jin, Regina Barzilay, and Tommi Jaakkola · 2018
Earlier work this paper cites.
Invariant and equivariant graph networks
Haggai Maron, Heli Ben-Hamu, Nadav Shamir, and Yaron Lipman · 2018
Earlier work this paper cites.
Moleculenet: a benchmark for molecular machine learning
Zhenqin Wu, Bharath Ramsundar, Evan N Feinberg, Joseph Gomes, Caleb Geniesse, Aneesh S Pappu, Karl Leswing, and Vijay Pande · 2018
Earlier work this paper cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2018
Earlier work this paper cites.
Cormorant: Covariant molecular neural networks
Brandon Anderson, Truong Son Hy, and Risi Kondor · 2019
Earlier work this paper cites.
On the equivalence between graph isomorphism testing and function approximation with gnns
Zhengdao Chen, Soledad Villar, Lei Chen, and Joan Bruna · 2019
Earlier work this paper cites.
Fast graph representation learning with pytorch geometric
Matthias Fey and Jan Eric Lenssen · 2019
Cited alongside, same era.
Strategies for pre-training graph neural networks
Weihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik, Percy Liang, Vijay Pande, and Jure Leskovec · 2019
Cited alongside, same era.
Weisfeiler and leman go neural: Higher-order graph neural networks
Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe · 2019
Cited alongside, same era.
The surprising power of graph neural networks with random node initialization
Ralph Abboud, Ismail Ilkan Ceylan, Martin Grohe, and Thomas Lukasiewicz · 2020
Cited alongside, same era.
On weisfeiler-leman invariance: Subgraph counts and related graph properties
V. Arvind, Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky · 2020
Directional graph networks
Dominique Beaini, Saro Passaro, Vincent Létourneau, Will Hamilton, Gabriele Corso, and Pietro Liò · 2021
Later among the works it cites.
Weisfeiler and lehman go cellular: Cw networks
Cristian Bodnar, Fabrizio Frasca, Nina Otter, Yuguang Wang, Pietro Lio, Guido F Montufar, and Michael Bronstein · 2021
Later among the works it cites.
Reconstruction for powerful graph representations
Leonardo Cotta, Christopher Morris, and Bruno Ribeiro · 2021
Later among the works it cites.
A short tutorial on the weisfeiler-lehman test and its variants
Ningyuan Teresa Huang and Soledad Villar · 2021
Later among the works it cites.
Rethinking graph transformers with spectral attention
Devin Kreuzer, Dominique Beaini, Will Hamilton, Vincent Létourneau, and Prudencio Tossou · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Principal neighbourhood aggregation for graph nets
Gabriele Corso, Luca Cavalleri, Dominique Beaini, Pietro Liò, and Petar Veličković · 2020
Cited alongside, same era.
A generalization of transformer networks to graphs
Vijay Prakash Dwivedi and Xavier Bresson · 2020
Cited alongside, same era.
Benchmarking graph neural networks
Vijay Prakash Dwivedi, Chaitanya K Joshi, Thomas Laurent, Yoshua Bengio, and Xavier Bresson · 2020
Cited alongside, same era.
Hierarchical inter-message passing for learning on molecular graphs
Matthias Fey, Jan-Gin Yuen, and Frank Weichert · 2020
Cited alongside, same era.
Directional message passing for molecular graphs
Johannes Gasteiger, Janek Groß, and Stephan Günnemann · 2020
Cited alongside, same era.
Intrinsic-extrinsic convolution and pooling for learning on 3d protein structures
Pedro Hermosilla, Marco Schäfer, Matěj Lang, Gloria Fackelmann, Pere Pau Vázquez, Barbora Kozlíková, Michael Krone, Tobias Ritschel, and Timo Ropinski · 2020
Cited alongside, same era.
Open graph benchmark: Datasets for machine learning on graphs
Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec · 2020
Cited alongside, same era.
Yi Liu, Limei Wang, Meng Liu, Xuan Zhang, Bora Oztekin, and Shuiwang Ji · 2021
Later among the works it cites.
Identity-aware graph neural networks
Jiaxuan You, Jonathan M Gomes-Selman, Rex Ying, and Jure Leskovec · 2021
Later among the works it cites.
Nested graph neural networks
Muhan Zhang and Pan Li · 2021
Later among the works it cites.
Equivariant subgraph aggregation networks
Beatrice Bevilacqua, Fabrizio Frasca, Derek Lim, Balasubramaniam Srinivasan, Chen Cai, Gopinath Balamurugan, Michael M Bronstein, and Haggai Maron · 2022
Later among the works it cites.
Improving graph neural network expressivity via subgraph isomorphism counting
Giorgos Bouritsas, Fabrizio Frasca, Stefanos Zafeiriou, and Michael M Bronstein · 2022
Later among the works it cites.
Long range graph benchmark
Vijay Prakash Dwivedi, Ladislav Rampášek, Michael Galkin, Ali Parviz, Guy Wolf, Anh Tuan Luu, and Dominique Beaini · 2022
Later among the works it cites.
Understanding and extending subgraph gnns by rethinking their symmetries
Fabrizio Frasca, Beatrice Bevilacqua, Michael M Bronstein, and Haggai Maron · 2022
Later among the works it cites.
Ordered subgraph aggregation networks
Chendi Qian, Gaurav Rattan, Floris Geerts, Mathias Niepert, and Christopher Morris · 2022
Later among the works it cites.
From stars to subgraphs: Uplifting any gnn with local structure awareness
Lingxiao Zhao, Wei Jin, Leman Akoglu, and Neil Shah · 2022
Later among the works it cites.
Boosting the cycle counting power of graph neural networks with i 2 -gnns
Yinan Huang, Xingang Peng, Jianzhu Ma, and Muhan Zhang · 2023
Closest in time.
Towards better evaluation of gnn expressiveness with brec dataset
Yanbo Wang and Muhan Zhang · 2023
Closest in time.
Efficiently counting substructures by subgraph gnns without running gnn on subgraphs
Zuoyu Yan, Junru Zhou, Liangcai Gao, Zhi Tang, and Muhan Zhang · 2023
Closest in time.
A complete expressiveness hierarchy for subgraph gnns via subgraph weisfeiler-lehman tests
Bohang Zhang, Guhao Feng, Yiheng Du, Di He, and Liwei Wang · 2023
Closest in time.