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)
Incoming Non-self Citations Over Time
Authors
- 1. Lu Chen (Swinburne University of Technology)
- 2. Chengfei Liu (Swinburne University of Technology)
- 3. Rui Zhou (Swinburne University of Technology)
- 4. Jiajie Xu (Soochow University)
- 5. Jianxin Li (Deakin University)
BibTeX Citation
@inproceedings{chen_sigmod21,
title = {{Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs}},
author = {Chen, Lu and Liu, Chengfei and Zhou, Rui and Xu, Jiajie and Li, Jianxin},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3459241},
url = {https://dl.acm.org/doi/10.1145/3448016.3459241},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
Previous
Page 1 / 1
Next
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 1,640 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010153865 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 2 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 3 | 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD |
| 4 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 5 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 6 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 7 | 7,731 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB |
| 8 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 9 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 10 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |