Towards Distributed Bitruss Decomposition on Bipartite Graphs
Summary: Distributed bitruss decomposition for bipartite graphs; SC-HBD baseline, SC-PBD peeling, and local indexes. DC-BD divide-and-conquer with optimizations; butterfly-complete subgraphs and a partitioner enable scalable shared-nothing deployment. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yue Wang (Shenzhen University)
- 2. Ruiqi Xu (National University of Singapore)
- 3. Xun Jian (Hong Kong University of Science and Technology)
- 4. Alexander Zhou (Hong Kong University of Science and Technology)
- 5. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{wang_vldb22,
title = {{Towards Distributed Bitruss Decomposition on Bipartite Graphs}},
author = {Wang, Yue and Xu, Ruiqi and Jian, Xun and Zhou, Alexander and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {9},
pages = {1889--1901},
doi = {10.14778/3538598.3538610},
url = {https://doi.org/10.14778/3538598.3538610},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,631 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD | 6.0563927e-05 |
| 8,324 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 5.3530306e-05 |
| 9,235 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 5.2032182e-05 |
| 10,496 | Nucleus Decomposition Revisited: An Efficient Counting-Based Approach | 2026 | SIGMOD | 4.9769913e-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 |
|---|---|---|---|---|
| 184 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026097449 |
| 1,444 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 0.00010630508 |
| 1,908 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB | 9.3935543e-05 |
| 3,670 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.1097731e-05 |
| 4,758 | Efficient Cohesive Subgraphs Detection in Parallel | 2014 | SIGMOD | 6.4293075e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,655 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB |
| 2 | 5,141 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB |
| 3 | 9,872 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD |
| 4 | 3,890 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |
| 5 | 5,721 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB |
| 6 | 7,753 | RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs | 2021 | VLDB |
| 7 | 3,831 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB |
| 8 | 11,603 | Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph | 2024 | VLDB |
| 9 | 3,868 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB |
| 10 | 1,224 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB |