Mix & Match: Subgraph Matching for Absolute Coverage
Summary: Targets coverage in subgraph matching: existing enumerators produce localized, biased streams when matches are massive, so the goal is to quickly surface results representative of the whole graph. M&M mixes global exploration (prioritizing first-level backtracking to expand coverage) with local pruning of non-coverage paths, finding ~2× more unique nodes than prior work. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Konstantinos Skitsas (Aarhus University)
- 2. Yuya Sasaki (University of Osaka)
- 3. Davide Mottin (Aarhus University)
- 4. Panagiotis Karras (Aarhus University; University of Copenhagen)
BibTeX Citation
@article{skitsas_vldb25,
title = {{Mix \& Match: Subgraph Matching for Absolute Coverage}},
author = {Skitsas, Konstantinos and Sasaki, Yuya and Mottin, Davide and Karras, Panagiotis},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {13},
pages = {5610--5622},
doi = {10.14778/3773731.3773737},
url = {https://doi.org/10.14778/3773731.3773737},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,294 | Sublime: Selecting Subgraph Matching Algorithms via Machine Learning | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 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 | 9,693 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB |
| 2 | 3,194 | GuP: Fast Subgraph Matching by Guard-based Pruning | 2023 | SIGMOD |
| 3 | 2,035 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 4 | 7,150 | BSX : Subgraph Matching with Batch Backtracking Search | 2025 | SIGMOD |
| 5 | 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 6 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 7 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 8 | 10,419 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 9 | 8,871 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD |
| 10 | 4,983 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |