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 (Peking University)
- 2. Lei Chen (Hong Kong University of Science and Technology)
- 3. Bin Cui (Peking University)
BibTeX Citation
@inproceedings{shao_sigmod14,
title = {{Efficient Cohesive Subgraphs Detection in Parallel}},
author = {Shao, Yingxia and Chen, Lei and Cui, Bin},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2593665},
url = {https://dl.acm.org/doi/10.1145/2588555.2593665},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,092 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00012072382 |
| 1,443 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 0.00010635542 |
| 2,869 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.9235321e-05 |
| 4,422 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 6.6060521e-05 |
| 6,752 | An Experimental Evaluation of SimRank-based Similarity Search Algorithms | 2017 | VLDB | 5.6905975e-05 |
| 7,281 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB | 5.5666074e-05 |
| 11,312 | X-Blossom: Massive Parallelization of Graph Maximum Matching | 2025 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012092602 |
| 22 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00055962491 |
| 100 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00033977856 |
| 589 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00015905948 |
| 5,950 | Managing and Mining Large Graphs: Systems and Implementations | 2012 | SIGMOD | 5.9367371e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,281 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB |
| 2 | 1,046 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD |
| 3 | 10,614 | Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware | 2026 | SIGMOD |
| 4 | 1,092 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB |
| 5 | 9,150 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB |
| 6 | 1,443 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB |
| 7 | 7,547 | Efficient Triangle-Connected Truss Community Search In Dynamic Graphs | 2023 | VLDB |
| 8 | 8,419 | Truss Decomposition in Hypergraphs | 2025 | VLDB |
| 9 | 3,495 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB |
| 10 | 100 | Truss Decomposition in Massive Networks | 2012 | VLDB |