TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database
Summary: Introduces Top-k Edge-Diversified Patterns Discovery (TED) for graph databases: retrieve subgraphs that maximize edge coverage across the repository while reducing topology redundancy. TED offers a guaranteed approximation plus two optimization strategies; experiments on real data show superiority to traditional subgraph mining. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kai Huang
- 2. Haibo Hu
- 3. Qingqing Ye
- 4. Kai Tian
- 5. Bolong Zheng
- 6. Xiaofang Zhou
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,941 | VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines | 2023 | VLDB | 4.2456408e-05 |
| 10,367 | Aster: Enhancing LSM-structures for Scalable Graph Database | 2025 | SIGMOD | 4.1945683e-05 |
| 10,485 | Finding Logic Bugs in Graph-processing Systems via Graph-cutting | 2025 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 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 |
|---|---|---|---|---|
| 8,210 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 4.5581054e-05 |
| 10,535 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB | 4.1945683e-05 |
| 11,410 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB | 4.1945683e-05 |
| 4,716 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9755569e-05 |
| 4,807 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB | 5.9092289e-05 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 10,308 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB | 4.1945683e-05 |
| 376 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00025097452 |
| 10,681 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.1945683e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |