Cited in
(38)- K-plex cover pooling for graph neural networks
- Graph coarsening: from scientific computing to machine learning
- SIGN
- Polynomial-based graph convolutional neural networks for graph classification
- GTED: Graph Traversal Edit Distance
- The journey of graph kernels through two decades
- Effectiveness of representation and length variation of shortest paths in graph classification
- Deep graph similarity learning: a survey
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Effective feature construction by maximum common subgraph sampling
- A gentle introduction to deep learning for graphs
- Graclus
- Scientific Data Mining
- FP2VEC
- GraphVAE
- BRENDA
- Interpretable multi-scale graph descriptors via structural compression
- Discriminative frequent subgraph mining with optimality guarantees
- Depth-based complexity traces of graphs
- gSpan
- Colibri
- Benchmark Graph Kernels
- graph2vec
- subgraph2vec
- FastGCN
- MoSS
- gBoost: a mathematical programming approach to graph classification and regression
- Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics
- gBoost
- Supervised neighborhood graph construction for semi-supervised classification
- A unifying view of explicit and implicit feature maps of graph kernels
- GTED
- KPlexPool
- Path integral based convolution and pooling for graph neural networks*
- Effective graph classification based on topological and label attributes
- Bosonic random walk neural networks for graph learning
- Fast depth-based subgraph kernels for unattributed graphs
- Propagation kernels: efficient graph kernels from propagated information
This page was built for software: AFGen
