Subgraph Counting

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

1 dataset whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Most implemented papers archive 2025-07-28

8 shown of 8 papers with code (17 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

• Higher-Order Graph Databases
  24 Jun 2025 1 repository listed
  Recent advances in graph databases (GDBs) have been driving interest in large-scale analytics, yet current systems fail to support higher-order (HO) interactions beyond first-order (one-hop) relations, which are crucial…
• Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
  16 Jan 2024 1 repository listed Syntology ran 0 of 3 samples · 3 unverified · 3 pointer-only (licence)
  Specifically, we identify a fundamental expressivity measure termed homomorphism expressivity, which quantifies the ability of GNN models to count graphs under homomorphism.
• Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions
  12 Dec 2023 1 repository listed
  We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy.
• DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting
  16 Aug 2023 1 repository listed Syntology ran 3 of 3 samples · 0 unverified
  We introduce DeSCo, a scalable neural deep subgraph counting pipeline, designed to accurately predict both the count and occurrence position of queries on target graphs post single training.
• Expressivity of Graph Neural Networks Through the Lens of Adversarial Robustness
  16 Aug 2023 1 repository listed Syntology ran 7 of 12 samples · 5 unverified · 12 pointer-only (licence)
  We perform the first adversarial robustness study into Graph Neural Networks (GNNs) that are provably more powerful than traditional Message Passing Neural Networks (MPNNs).
• Improving Expressivity of Graph Neural Networks using Localization
  31 May 2023 1 repository listed
  We focus on the specific problem of subgraph counting and give localized versions of $k-$WL for any k.
• Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams
  13 Nov 2022 1 repository listed
  Specifically, we propose a weighted sampling algorithm called WSD for estimating the subgraph count in a fully dynamic graph stream, which samples the edges based on their weights that indicate their importance and…
• Evaluating Graph Generative Models with Contrastively Learned Features
  13 Jun 2022 1 repository listed
  A wide range of models have been proposed for Graph Generative Models, necessitating effective methods to evaluate their quality.

Syntology lines on 3 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.