Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks

Summary: Vertex-priority-based BFC-VP for butterfly counting in large bipartite networks; reduces wedge enumeration vs layer-priority methods. Cache-aware optimizations and external/parallel execution preserve theoretical time complexity while delivering up to 100x speedups on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11813
Venue: VLDB
Year: 2019
Pagerank: 0.00011714263
Overall Rank: 1,484 | 89.68%
DOI: 10.14778/3339490.3339497

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 29 of 29 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,286	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	9.0982591e-05
2,521	Efficient Algorithms for Maximal k-Biplex Enumeration	2022	SIGMOD	8.6065919e-05
2,903	(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.9375744e-05
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
4,171	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	6.3879236e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
4,481	Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs	2024	VLDB	6.1485442e-05
4,534	Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice	2020	VLDB	6.1049756e-05
4,556	Distributed Subgraph Matching on Timely Dataflow	2019	VLDB	6.0883757e-05
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
4,743	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD	5.9586508e-05
4,843	Butterfly-Core Community Search over Labeled Graphs	2021	VLDB	5.8823824e-05
5,009	HUGE: An Efficient and Scalable Subgraph Enumeration System	2021	SIGMOD	5.761237e-05
5,124	Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach	2023	SIGMOD	5.6795646e-05
5,474	Efficient Load-Balanced Butterfly Counting on GPU	2022	VLDB	5.4881807e-05
5,540	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	5.4498271e-05
5,766	Scalable and Effective Bipartite Network Embedding	2022	SIGMOD	5.3363253e-05
5,773	I/O-Efficient Butterfly Counting at Scale	2023	SIGMOD	5.3319911e-05
6,795	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	4.9242446e-05
7,451	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7263711e-05
7,804	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	4.6466513e-05
8,809	Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks	2024	VLDB	4.4443756e-05
9,244	Densest Multipartite Subgraph Search in Heterogeneous Information Networks	2024	VLDB	4.3690661e-05
10,157	Efficient and Effective Biclique Counting with Local Differential Privacy	2026	SIGMOD	4.1945683e-05
10,300	Scalable Approximate Biclique Counting over Large Bipartite Graphs	2026	VLDB	4.1945683e-05
10,563	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1945683e-05
11,027	BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank	2024	VLDB	4.1945683e-05
11,062	Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph	2024	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
124	DBMSs On A Modern Processor: Where Does Time Go?	1999	VLDB	0.00045103515
589	Massive Graph Triangulation	2013	SIGMOD	0.00019576567
1,150	K-Core Decomposition of Large Networks on a Single PC	2016	VLDB	0.00013657353
1,665	The More the Merrier: Efficient Multi-Source Graph Traversal	2015	VLDB	0.00010967716
1,676	Speedup Graph Processing by Graph Ordering	2016	SIGMOD	0.00010946423
1,903	More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks	2014	VLDB	0.00010155777
1,973	Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions	2018	SIGMOD	9.8913631e-05
4,394	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	6.224902e-05
13,508	MapDupReducer: Detecting Near Duplicates over Massive Datasets	2010	SIGMOD	-

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
7,788	Towards Distributed Bitruss Decomposition on Bipartite Graphs	2022	VLDB	4.651009e-05
11,062	Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph	2024	VLDB	4.1945683e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
4,171	Butterfly Counting on Uncertain Bipartite Graphs	2022	VLDB	6.3879236e-05
5,773	I/O-Efficient Butterfly Counting at Scale	2023	SIGMOD	5.3319911e-05
5,474	Efficient Load-Balanced Butterfly Counting on GPU	2022	VLDB	5.4881807e-05
10,563	Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index	2025	VLDB	4.1945683e-05
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