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
- 2. Ada Wai-Chee Fu
- 3. Ruifeng Liu
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,163 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5685178e-05 |
| 9,106 | TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database | 2023 | SIGMOD | 4.3909979e-05 |
| 9,726 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD | 4.2901665e-05 |
| 9,847 | Discovering Top-k Relevant and Diversified Rules | 2024 | SIGMOD | 4.2680295e-05 |
| 10,320 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB | 4.1905499e-05 |
| 10,852 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB | 4.1905499e-05 |
| 10,855 | Mix & Match: Subgraph Matching for Absolute Coverage | 2025 | VLDB | 4.1905499e-05 |
| 11,477 | MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces | 2021 | SIGMOD | 4.1905499e-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 | Pagerank |
|---|---|---|---|---|
| 4,959 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.7992713e-05 |
| 8,504 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB | 4.491551e-05 |
| 11,574 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD | 4.1905499e-05 |
| 6,085 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD | 5.2165029e-05 |
| 4,207 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3519481e-05 |
| 648 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018688754 |
| 4,748 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB | 5.9432853e-05 |
| 10,320 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB | 4.1905499e-05 |
| 3,119 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD | 7.5393376e-05 |
| 4,486 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB | 6.1413967e-05 |