Back to papers
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs
Summary: Two exact MBB solvers: a small-dense graph algorithm O*(1.3803^n) and a large-sparse graph algorithm O*(1.3803^delta_hat). It splits sparse graphs into dense subgraphs (<=delta_hat), runs the dense solver on each, and applies bounds, heuristics, and reductions for large-scale graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6266
- Venue
- SIGMOD
- Year
- 2021
- Pagerank
- 9.2479064e-05
- Overall Rank
- 2,225 | 84.53%
- DOI
-
10.1145/3448016.3459241
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 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,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 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-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 |
| 9,390 |
Efficient Maximum s-Bundle Search via Local Vertex Connectivity |
2025 |
SIGMOD |
4.3441378e-05 |
| 9,398 |
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method |
2025 |
VLDB |
4.3441378e-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,530 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 10,959 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1945683e-05 |
| 8,897 |
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs |
2025 |
SIGMOD |
4.427232e-05 |
| 2,903 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.9375744e-05 |
| 891 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015564292 |
| 2,521 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.6065919e-05 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6598957e-05 |
| 5,124 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
5.6795646e-05 |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1945683e-05 |