Enumerating Graph Pattern Matches with ML Oracles
Summary: ML-guided SubIso enumeration: revise VF3 with an oracle that ranks candidate matches, then verify to prune backtracking. Establish EnumP-completeness plus sharp tradeoffs among output-polynomiality, consistency, and robustness; empirically up to 21x speedup. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wenfei Fan (Beihang University; Shenzhen University; University of Edinburgh)
- 2. Yixuan Luo (Beihang University)
- 3. Ping Lu (Beihang University)
- 4. Xiaoke Zhu (Shenzhen University)
BibTeX Citation
@inproceedings{fan_sigmod26,
title = {{Enumerating Graph Pattern Matches with ML Oracles}},
author = {Fan, Wenfei and Luo, Yixuan and Lu, Ping and Zhu, Xiaoke},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786648},
url = {https://dl.acm.org/doi/10.1145/3786648},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 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 |
|---|---|---|---|---|
| 1 | 1,506 | Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs | 2015 | VLDB |
| 2 | 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 3 | 2,166 | Subgraph Matching: on Compression and Computation | 2018 | VLDB |
| 4 | 8,037 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |
| 5 | 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 6 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 7 | 4,075 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 8 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 9 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 10 | 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB |