Efficient Cohesive Subgraphs Detection in Parallel
Summary: PETA is a parallel, efficient k-truss detector that builds TC-subgraphs per node for fast local k-truss discovery. It bounds communication to 3× triangles, preserves serial-like compute, and uses a subgraph-oriented parallel model; experiments show 2–19× less communication, 80–95% fewer iterations, and ~80% speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yingxia Shao
- 2. Lei Chen
- 3. Bin Cui
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
| 3,273 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 7.2956944e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 6,789 | An Experimental Evaluation of SimRank-based Similarity Search Algorithms | 2017 | VLDB | 4.9251746e-05 |
| 7,788 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB | 4.651009e-05 |
| 10,670 | X-Blossom: Massive Parallelization of Graph Maximum Matching | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 37 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.0007522744 |
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 738 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00017435236 |
| 5,504 | Managing and Mining Large Graphs: Systems and Implementations | 2012 | SIGMOD | 5.4737941e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,788 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB | 4.651009e-05 |
| 1,500 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011674394 |
| 10,136 | Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware | 2026 | SIGMOD | 4.1945683e-05 |
| 1,530 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00011495611 |
| 8,975 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB | 4.4179255e-05 |
| 2,039 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.7061003e-05 |
| 8,169 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB | 4.5698941e-05 |
| 10,596 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 3,975 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB | 6.5736847e-05 |
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |