Database Paper Browser

Back to papers

Maximum Biclique Search at Billion Scale

Summary: Divides max-biclique search into O(log n) subproblems with restricted regions; prunes by one-hop/two-hop neighbors while preserving the optimal constrained biclique. Demonstrates billion-scale graphs and a 50% recall gain on Alibaba fraud detection. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12048
Venue
VLDB
Year
2020
Pagerank
0.00015564292
Overall Rank
891 | 93.81%
DOI
10.14778/3397230.3397234

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 26 of 26 citing papers.

Rank Citing Paper Year Venue Pagerank
2,225 Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs 2021 SIGMOD 9.2479064e-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
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,743 Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions 2021 SIGMOD 5.9586508e-05
5,124 Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach 2023 SIGMOD 5.6795646e-05
5,149 Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach 2021 VLDB 5.6627295e-05
5,474 Efficient Load-Balanced Butterfly Counting on GPU 2022 VLDB 5.4881807e-05
5,773 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 5.3319911e-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
7,757 Identifying Similar-Bicliques in Bipartite Graphs 2022 VLDB 4.6598957e-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,244 Densest Multipartite Subgraph Search in Heterogeneous Information Networks 2024 VLDB 4.3690661e-05
10,078 Estimating Biclique Counts with Accuracy Guarantees 2026 SIGMOD 4.1945683e-05
10,119 Theoretically and Practically Efficient Maximum Biclique Search 2026 SIGMOD 4.1945683e-05
10,189 Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs 2026 SIGMOD 4.1945683e-05
10,373 Density Decomposition of Bipartite Graphs 2025 SIGMOD 4.1945683e-05
10,530 Most Similar Biclique Search at Scale 2025 VLDB 4.1945683e-05
10,535 In-depth Analysis of Densest Subgraph Discovery in a Unified Framework 2025 VLDB 4.1945683e-05
10,681 Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory 2025 VLDB 4.1945683e-05
11,042 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 4.1945683e-05
11,060 Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs 2024 VLDB 4.1945683e-05
11,062 Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph 2024 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
847 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015993322
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
10,959 Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee 2024 SIGMOD 4.1945683e-05
10,189 Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs 2026 SIGMOD 4.1945683e-05
6,183 Efficient Core Maintenance in Large Bipartite Graphs 2023 SIGMOD 5.1667703e-05
2,225 Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs 2021 SIGMOD 9.2479064e-05
847 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00015993322
7,757 Identifying Similar-Bicliques in Bipartite Graphs 2022 VLDB 4.6598957e-05
10,530 Most Similar Biclique Search at Scale 2025 VLDB 4.1945683e-05
3,492 Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 7.044442e-05
5,124 Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach 2023 SIGMOD 5.6795646e-05
10,119 Theoretically and Practically Efficient Maximum Biclique Search 2026 SIGMOD 4.1945683e-05