DBScholar

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
h75d96c4ca6f909f7
Venue
SIGMOD
Year
2021
Pagerank
9.598858e-05
Overall Rank
1,802 | 87.93%
DOI
10.1145/3448016.3459241

Incoming Non-self Citations Over Time

Authors

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 16 of 16 citing papers.

Rank Citing Paper Year Venue Pagerank
2,314 Efficient Algorithms for Maximal k-Biplex Enumeration 2022 SIGMOD 8.6412801e-05
2,339 (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 8.599495e-05
2,754 Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 8.0385316e-05
3,881 Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions 2021 SIGMOD 6.9309694e-05
4,606 Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach 2023 SIGMOD 6.4898086e-05
5,643 Efficient Core Maintenance in Large Bipartite Graphs 2023 SIGMOD 6.0363665e-05
7,851 Densest Multipartite Subgraph Search in Heterogeneous Information Networks 2024 VLDB 5.4232533e-05
8,187 Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks 2024 VLDB 5.3652509e-05
9,259 BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs 2025 SIGMOD 5.1860131e-05
9,713 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 5.124163e-05
9,714 Maximum k-Plex Search: An Alternated Reduction-and-Bound Method 2025 VLDB 5.124163e-05
10,558 Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy 2026 SIGMOD 4.9605343e-05
10,641 Estimating Biclique Counts with Accuracy Guarantees 2026 SIGMOD 4.9605343e-05
10,671 Theoretically and Practically Efficient Maximum Biclique Search 2026 SIGMOD 4.9605343e-05
10,930 Maximum Defective Biclique Search in Large Bipartite Graphs 2026 VLDB 4.9605343e-05
11,280 Most Similar Biclique Search at Scale 2025 VLDB 4.9605343e-05
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
771 Maximum Biclique Search at Billion Scale 2020 VLDB 0.00014081924
1,613 Distance-generalized Core Decomposition 2019 SIGMOD 0.00010057822
Previous Page 1 / 1 Next

Semantically Similar Papers