Fetching the paper…
Reading the bibliography…
Graph neural networks (GNNs) are a powerful architecture for tackling graph learning tasks, yet have been shown to be oblivious to eminent substructures such as cycles.
The reduction of a graph to canonical form and the algebra which appears therein
B. Weisfeiler and A. A. Lehman · 1968
Earlier work this paper cites.
Random graph isomorphism
L. Babai, P. Erdős, and S. M. Selkow · 1980
Earlier work this paper cites.
On the use of size functions for shape analysis
A. Verri, C. Uras, P. Frosini, and M. Ferri · 1993
Earlier work this paper cites.
The framed Morse complex and its invariants
S. A. Barannikov · 1994
Earlier work this paper cites.
Classification of regular two-graphs on 36 36 and 38 38 vertices
B. D. McKay and E. Spence · 2001
Earlier work this paper cites.
Topological persistence and simplification
H. Edelsbrunner, D. Letscher, and A. J. Zomorodian · 2002
Earlier work this paper cites.
Algebraic topology
A. Hatcher · 2002
Earlier work this paper cites.
Computing multidimensional persistence
G. Carlsson, G. Singh, and A. Zomorodian · 2009
Earlier work this paper cites.
Extending persistence using Poincaré and Lefschetz duality
D. Cohen-Steiner, H. Edelsbrunner, and J. Harer · 2009
Earlier work this paper cites.
Fast subtree kernels on graphs
N. Shervashidze and K. Borgwardt · 2009
Earlier work this paper cites.
Computational topology: An introduction
H. Edelsbrunner and J. Harer · 2010
Earlier work this paper cites.
Fast construction of the Vietoris–Rips complex
A. J. Zomorodian · 2010
Earlier work this paper cites.
Zigzag persistent homology in matrix multiplication time
N. Milosavljević, D. Morozov, and P. Skraba · 2011
Earlier work this paper cites.
Linear-size approximations to the Vietoris–Rips filtration
D. R. Sheehy · 2013
Earlier work this paper cites.
Continuation of point clouds via persistence diagrams
M. Gameiro, Y. Hiraoka, and I. Obayashi · 2016
Earlier work this paper cites.
On valid optimal assignment kernels and applications to graph classification
N. M. Kriege, P.-L. Giscard, and R. Wilson · 2016
Earlier work this paper cites.
X. Bresson and T. Laurent · 2017
Earlier work this paper cites.
On the combinatorial power of the Weisfeiler–Lehman algorithm
M. Fürer · 2017
Cited alongside, same era.
Deep learning with topological signatures
C. Hofer, R. Kwitt, M. Niethammer, and A. Uhl · 2017
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
T. N. Kipf and M. Welling · 2017
Cited alongside, same era.
Deep sets
M. Zaheer, S. Kottur, S. Ravanbakhsh, B. Poczos, R. R. Salakhutdinov, and A. J. Smola · 2017
Cited alongside, same era.
Topological function optimization for continuous shape matching
A. Poulenard, P. Skraba, and M. Ovsjanikov · 2018
Cited alongside, same era.
Graph attention networks
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio · 2018
Cited alongside, same era.
Experiment tracking with weights and biases, 2020
L. Biewald · 2020
Later among the works it cites.
Graph kernels: State-of-the-art and future challenges
K. Borgwardt, E. Ghisu, F. Llinares-López, L. O’Bray, and B. Rieck · 2020
Later among the works it cites.
PersLay: A neural network layer for persistence diagrams and new graph topological signatures
M. Carrière, F. Chazal, Y. Ike, T. Lacombe, M. Royer, and Y. Umeda · 2020
Later among the works it cites.
Benchmarking graph neural networks
V. P. Dwivedi, C. K. Joshi, T. Laurent, Y. Bengio, and X. Bresson · 2020
Later among the works it cites.
Graph filtration learning
C. D. Hofer, F. Graf, B. Rieck, M. Niethammer, and R. Kwitt · 2020
Later among the works it cites.
A survey on graph kernels
N. M. Kriege, F. D. Johansson, and C. Morris · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the equivalence between graph isomorphism testing and function approximation with GNNs
Z. Chen, S. Villar, L. Chen, and J. Bruna · 2019
Cited alongside, same era.
PyTorch Lightning, 2019
W. Falcon et al · 2019
Cited alongside, same era.
Fast graph representation learning with PyTorch Geometric
M. Fey and J. E. Lenssen · 2019
Cited alongside, same era.
Learning representations of persistence barcodes
C. D. Hofer, R. Kwitt, and M. Niethammer · 2019
Cited alongside, same era.
Provably powerful graph networks
H. Maron, H. Ben-Hamu, H. Serviansky, and Y. Lipman · 2019
Cited alongside, same era.
Weisfeiler and Leman go neural: Higher-order graph neural networks
C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe · 2019
Cited alongside, same era.
Later among the works it cites.
Topological autoencoders
M. Moor, M. Horn, B. Rieck, and K. Borgwardt · 2020
Later among the works it cites.
TUDataset: A collection of benchmark datasets for learning with graphs
C. Morris, N. M. Kriege, F. Bause, K. Kersting, P. Mutzel, and M. Neumann · 2020
Later among the works it cites.
N. Swenson, A. S. Krishnapriyan, A. Buluc, D. Morozov, and K. Yelick · 2020
Later among the works it cites.
Persistence enhanced graph neural network
Q. Zhao, Z. Ye, C. Chen, and Y. Wang · 2020
Later among the works it cites.
Weisfeiler and Lehman go topological: Message passing simplicial networks
C. Bodnar, F. Frasca, Y. Wang, N. Otter, G. F. Montufar, P. Lió, and M. Bronstein · 2021
Closest in time.
Improving graph neural network expressivity via subgraph isomorphism counting
G. Bouritsas, F. Frasca, S. Zafeiriou, and M. M. Bronstein · 2021
Closest in time.
Optimizing persistent homology based functions
M. Carrière, F. Chazal, M. Glisse, Y. Ike, H. Kannan, and Y. Umeda · 2021
Closest in time.
A survey of topological machine learning methods
F. Hensel, M. Moor, and B. Rieck · 2021
Closest in time.
A gentle introduction to graph neural networks
B. Sanchez-Lengeling, E. Reif, A. Pearce, and A. B. Wiltschko · 2021
Closest in time.
Persistent homology based graph convolution network for fine-grained 3d shape segmentation
C.-C. Wong and C.-M. Vong · 2021
Closest in time.
A comprehensive survey on graph neural networks
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu · 2021
Closest in time.