Bound-Tightened Densest Subgraph Discovery on GPU
Summary: GPU-accelerated exact densest k-subgraph discovery, combining warp-level k-clique enumeration, clique-core/edge pruning, and component decomposition. Parallel push-relabel max-flow with tight density bounds delivers substantial speedups over CPU baselines while preserving optimality. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wajid Manzoor (Rowan University)
- 2. Ke Fan (Temple University)
- 3. Muhammad Shaheer (Rowan University)
- 4. Guimu Guo (Rowan University)
BibTeX Citation
@inproceedings{manzoor_sigmod26,
title = {{Bound-Tightened Densest Subgraph Discovery on GPU}},
author = {Manzoor, Wajid and Fan, Ke and Shaheer, Muhammad and Guo, Guimu},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802023},
url = {https://dl.acm.org/doi/10.1145/3802023},
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 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 589 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00015905948 |
| 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.1416822e-05 |
| 5,450 | Accurate and Fast Approximate Graph Pattern Mining at Scale | 2025 | VLDB | 6.1247776e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,442 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 2 | 8,974 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD |
| 3 | 3,412 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 4 | 11,916 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 5 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 6 | 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 7 | 10,808 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 8 | 7,807 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 9 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 10 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |