Diversified Top-k Subgraph Querying in a Large Graph
Summary: Diversified top-k subgraph querying in large graphs: up to k isomorphic subgraphs maximize coverage. Proposes a level-based algorithm with early termination and a provable approximation; experiments on data show near-optimal results and ~10 ms queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhengwei Yang (Chinese University of Hong Kong)
- 2. Ada Wai-Chee Fu (Chinese University of Hong Kong)
- 3. Ruifeng Liu (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{yang_sigmod16,
title = {{Diversified Top-k Subgraph Querying in a Large Graph}},
author = {Yang, Zhengwei and Fu, Ada Wai-Chee and Liu, Ruifeng},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2915216},
url = {https://dl.acm.org/doi/10.1145/2882903.2915216},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,235 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 5.4608734e-05 |
| 8,871 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD | 5.35418e-05 |
| 9,131 | TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database | 2023 | SIGMOD | 5.3184767e-05 |
| 9,999 | Discovering Top-k Relevant and Diversified Rules | 2024 | SIGMOD | 5.1814573e-05 |
| 10,606 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB | 5.093636e-05 |
| 11,072 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB | 5.093636e-05 |
| 11,075 | Mix & Match: Subgraph Matching for Absolute Coverage | 2025 | VLDB | 5.093636e-05 |
| 11,671 | MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces | 2021 | SIGMOD | 5.093636e-05 |
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 | 4,853 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB |
| 2 | 8,493 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB |
| 3 | 10,050 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD |
| 4 | 5,965 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD |
| 5 | 4,474 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 6 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 7 | 3,908 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 8 | 10,606 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB |
| 9 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 10 | 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |