Neural Subgraph Counting with Wasserstein Estimator
Summary: NeurSC: an approximate subgraph counting algorithm with two components: an extraction module and a Wasserstein estimator WEst. It deploys a Wasserstein discriminator to align query and data graphs, enabling robust, scalable estimation on large real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hanchen Wang
- 2. Rong Hu
- 3. Ying Zhang
- 4. Lu Qin
- 5. Wei Wang
- 6. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 29 of 29 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,845 | Path-centric Cardinality Estimation for Subgraph Matching | 2025 | VLDB | 4.2680295e-05 |
| 7,939 | Machine Learning for Subgraph Extraction: Methods, Applications and Challenges | 2023 | VLDB | 4.6089395e-05 |
| 6,436 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB | 5.0554554e-05 |
| 5,530 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB | 5.4562393e-05 |
| 5,007 | Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning | 2022 | VLDB | 5.7581517e-05 |
| 7,936 | Fast Local Subgraph Counting | 2024 | VLDB | 4.6089395e-05 |
| 6,288 | Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach | 2024 | VLDB | 5.1226099e-05 |
| 10,096 | NeuSO: Neural Optimizer for Subgraph Queries | 2026 | SIGMOD | 4.1905499e-05 |
| 10,640 | Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach | 2025 | VLDB | 4.1905499e-05 |
| 3,781 | A Learned Sketch for Subgraph Counting | 2021 | SIGMOD | 6.7691344e-05 |