K-plex cover pooling for graph neural networks
From MaRDI portal
Publication:2238356
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)
Recommendations
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A gentle introduction to deep learning for graphs
- A note on the problem of reporting maximal cliques
- Algorithm 457: finding all cliques of an undirected graph
- Convolutional Neural Network Architectures for Signals Supported on Graphs
- Deep learning
- Fast Haar transforms for graph neural networks
- Fast unfolding of communities in large networks
- Graph kernels
- Large-scale clique cover of real-world networks
- Neocognition: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position
- Powers of tensors and fast matrix multiplication
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Wavelets on graphs via spectral graph theory
- Weisfeiler-Lehman graph kernels
This page was built for publication: K-plex cover pooling for graph neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238356)