Accelerating Truss Decomposition on Heterogeneous Processors
Summary: Accelerates in-memory truss decomposition on billion-edge graphs via CPU–GPU co-processing, with compacted intermediates and data-skew-aware triangle enumeration. Runtime strategy selects peeling versus direct triangle counting to reach the target k-truss, delivering up to 10× speedups over the state-of-the-art; code publicly available. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yulin Che
- 2. Zhuohang Lai
- 3. Shixuan Sun
- 4. Yue Wang
- 5. Qiong Luo
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,168 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 6.391271e-05 |
| 4,270 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 6.3067205e-05 |
| 6,880 | Theoretically and Practically Efficient Parallel Nucleus Decomposition | 2022 | VLDB | 4.8970985e-05 |
| 8,014 | Efficient Star-based Truss Maintenance on Dynamic Graphs | 2023 | SIGMOD | 4.6058845e-05 |
| 9,647 | BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers | 2024 | VLDB | 4.3109001e-05 |
| 10,136 | Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware | 2026 | SIGMOD | 4.1945683e-05 |
| 10,947 | Parallel Algorithms for Hierarchical Nucleus Decomposition | 2024 | SIGMOD | 4.1945683e-05 |
| 11,062 | Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 1,530 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00011495611 |
| 2,039 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.7061003e-05 |
| 2,512 | Fast Hierarchy Construction for Dense Subgraphs | 2017 | VLDB | 8.6196023e-05 |
| 2,846 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.0234377e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,495 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD | 4.1945683e-05 |
| 8,975 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB | 4.4179255e-05 |
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.3849295e-05 |
| 4,921 | Efficient Cohesive Subgraphs Detection in Parallel | 2014 | SIGMOD | 5.8237536e-05 |
| 2,039 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.7061003e-05 |
| 4,522 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD | 6.1146374e-05 |
| 4,168 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 6.391271e-05 |
| 10,136 | Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware | 2026 | SIGMOD | 4.1945683e-05 |
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 10,596 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1945683e-05 |