Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
Summary: Define DTkSM: select k isomorphic matches maximizing pairwise topological distances to enforce global/topological diversity beyond vertex-coverage objectives. Propose PDD: partition-based retrieval with embedding-driven filtering and densest-based Partition Adjacency Graph selection, yielding up to 10^4× speedups and near-optimal diversity. (summarized by gpt-5-mini on Mar 13 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Liuyi Chen (Hunan University)
- 2. Yuchen Hu (Hunan University)
- 3. Zhengyi Yang (University of New South Wales)
- 4. Xu Zhou (Hunan University)
- 5. Wenjie Zhang (University of New South Wales)
- 6. Kenli Li (Hunan University)
BibTeX Citation
@article{chen_vldb26,
title = {{Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching}},
author = {Chen, Liuyi and Hu, Yuchen and Yang, Zhengyi and Zhou, Xu and Zhang, Wenjie and Li, Kenli},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {4},
pages = {698--712},
doi = {10.14778/3785297.3785310},
url = {https://doi.org/10.14778/3785297.3785310},
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 31 of 31 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,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 2 | 10,879 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 3 | 658 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 4 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 5 | 4,099 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 6 | 10,630 | Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings | 2026 | SIGMOD |
| 7 | 6,245 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 8 | 3,582 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 9 | 5,486 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 10 | 3,992 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |