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)

Paper ID: 12737
Venue: VLDB
Year: 2022
Pagerank: 5.4829054e-05
Overall Rank: 5,483 | 61.90%
DOI: 10.14778/3551793.3551806

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,484	Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs	2024	VLDB	6.1426351e-05
7,450	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7218383e-05
9,411	Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy	2024	SIGMOD	4.3399748e-05
10,079	Fast Optimal Group Steiner Tree Search using GPUs	2026	SIGMOD	4.1905499e-05
10,157	Efficient and Effective Biclique Counting with Local Differential Privacy	2026	SIGMOD	4.1905499e-05

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.00065421423
888	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015549756
1,150	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013647447
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011705344
2,933	Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU	2020	VLDB	7.8633648e-05
4,146	Accelerating Triangle Counting on GPU	2021	SIGMOD	6.4065776e-05
4,533	Efficient Document Analytics on Compressed Data: Method, Challenges, Algorithms, Insights	2018	VLDB	6.1015426e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,235	iBFS: Concurrent Breadth-First Search on GPUs	2016	SIGMOD	7.3298263e-05
10,276	gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs	2026	VLDB	4.1905499e-05
3,488	GPU-Accelerated Subgraph Enumeration on Partitioned Graphs	2020	SIGMOD	7.0460627e-05
7,789	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.6465475e-05
4,146	Accelerating Triangle Counting on GPU	2021	SIGMOD	6.4065776e-05
10,572	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1905499e-05
7,450	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7218383e-05
5,782	I/O-Efficient Butterfly Counting at Scale	2023	SIGMOD	5.3268721e-05
4,484	Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs	2024	VLDB	6.1426351e-05
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011705344