SOTAVerified

Subgraph Counting

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 1–17 of 17 papers

TitleStatusHype
Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN ExpressivenessCode1
DeSCo: Towards Generalizable and Scalable Deep Subgraph CountingCode1
Higher-Order Graph DatabasesCode0
Studying and Improving Graph Neural Network-based Motif Estimation—0
BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs—0
Homomorphism Expressivity of Spectral Invariant Graph Neural Networks—0
Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements—0
Discovering Motifs to Fingerprint Multi-Layer Networks: a Case Study on the Connectome of C. Elegans—0
Representation Learning for Frequent Subgraph Mining—0
Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash FunctionsCode0
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters—0
Expressivity of Graph Neural Networks Through the Lens of Adversarial RobustnessCode0
The Expressive Power of Graph Neural Networks: A Survey—0
Improving Expressivity of Graph Neural Networks using LocalizationCode0
Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph StreamsCode0
Evaluating Graph Generative Models with Contrastively Learned FeaturesCode0
Two-level Graph Neural Network—0
Show:102550

No leaderboard results yet.