Efficient Load-Balanced Butterfly Counting on GPU
Summary: G-BFC, a GPU-based butterfly counting approach for large bipartite graphs, unlocks the serial region with shared memory. Adaptive load balancing and wedge-reduction preprocessing tackle workload imbalance and wedge traversal, delivering up to 19.8x speedup across eleven real datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qingyu Xu
- 2. Feng Zhang
- 3. Zhiming Yao
- 4. Lv Lu
- 5. Xiaoyong Du
- 6. Dong Deng
- 7. Bingsheng He
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,481 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 6.1485442e-05 |
| 7,451 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7263711e-05 |
| 9,405 | Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy | 2024 | SIGMOD | 4.3441378e-05 |
| 10,079 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,157 | Efficient and Effective Biclique Counting with Local Differential Privacy | 2026 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065491112 |
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 1,150 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013657353 |
| 1,484 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011714263 |
| 3,009 | Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU | 2020 | VLDB | 7.7214924e-05 |
| 4,168 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 6.391271e-05 |
| 4,531 | Efficient Document Analytics on Compressed Data: Method, Challenges, Algorithms, Insights | 2018 | VLDB | 6.1073703e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,171 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 6.3879236e-05 |
| 3,233 | iBFS: Concurrent Breadth-First Search on GPUs | 2016 | SIGMOD | 7.3361904e-05 |
| 3,641 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 6.8884895e-05 |
| 7,788 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB | 4.651009e-05 |
| 4,168 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 6.391271e-05 |
| 10,563 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB | 4.1945683e-05 |
| 7,451 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7263711e-05 |
| 5,773 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD | 5.3319911e-05 |
| 4,481 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 6.1485442e-05 |
| 1,484 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011714263 |