An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
Summary: Introduces IPPV, an exact top-k locally h-clique densest-subgraph pipeline under a non-overlapping constraint. It fuses convex-bound tightening, cross-subgraph clique handling via decomposition, and fast flow-based verification, with proofs of exactness and applicability to broader pattern-densest problems. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaojia Xu (Renmin University of China)
- 2. Haoyu Liu (Renmin University of China)
- 3. Xiaowei Lv (Renmin University of China)
- 4. Yongcai Wang (Renmin University of China)
- 5. Deying Li (Renmin University of China)
BibTeX Citation
@inproceedings{xu_sigmod24,
title = {{An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery}},
author = {Xu, Xiaojia and Liu, Haoyu and Lv, Xiaowei and Wang, Yongcai and Li, Deying},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3698800},
url = {https://dl.acm.org/doi/10.1145/3698800},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,565 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 4.9793485e-05 |
| 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 131 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00030242586 |
| 274 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022490994 |
| 561 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016396211 |
| 589 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00015905948 |
| 988 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00012660447 |
| 1,209 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011534572 |
| 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.1416822e-05 |
| 2,905 | Piggybacking on Social Networks | 2013 | VLDB | 7.8780984e-05 |
| 3,064 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 7.6898682e-05 |
| 5,205 | Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers | 2022 | VLDB | 6.2300261e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,064 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB |
| 2 | 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 3 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 4 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 5 | 7,807 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 6 | 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 7 | 4,923 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 8 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 9 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 10 | 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |