(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs

Summary: Proposes BCList, a branch-and-bound baseline for enumerating/counting (p,q)-bicliques in large sparse bipartite graphs. BCList++ uses a layer-based search anchored on U or V, with a density estimator and array-based optimizations, delivering up to 1000x speedups and boosting GNN performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12648
Venue: VLDB
Year: 2022
Pagerank: 7.9375744e-05
Overall Rank: 2,903 | 79.81%
DOI: 10.14778/3489496.3489497

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 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
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
5,124	Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach	2023	SIGMOD	5.6795646e-05
6,183	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1667703e-05
6,513	Efficient Parallel D-core Decomposition at Scale	2024	VLDB	5.0321577e-05
7,451	Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks	2023	SIGMOD	4.7263711e-05
8,809	Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks	2024	VLDB	4.4443756e-05
8,897	BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs	2025	SIGMOD	4.427232e-05
9,405	Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy	2024	SIGMOD	4.3441378e-05
10,078	Estimating Biclique Counts with Accuracy Guarantees	2026	SIGMOD	4.1945683e-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,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05

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
891	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00015564292
1,484	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011714263
1,570	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011322927
2,225	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.2479064e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,521	Efficient Algorithms for Maximal k-Biplex Enumeration	2022	SIGMOD	8.6065919e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
2,225	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs	2021	SIGMOD	9.2479064e-05
7,757	Identifying Similar-Bicliques in Bipartite Graphs	2022	VLDB	4.6598957e-05
10,959	Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee	2024	SIGMOD	4.1945683e-05
10,119	Theoretically and Practically Efficient Maximum Biclique Search	2026	SIGMOD	4.1945683e-05
10,078	Estimating Biclique Counts with Accuracy Guarantees	2026	SIGMOD	4.1945683e-05
4,626	Efficient Biclique Counting in Large Bipartite Graphs	2023	SIGMOD	6.0399035e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
10,300	Scalable Approximate Biclique Counting over Large Bipartite Graphs	2026	VLDB	4.1945683e-05