Theoretically and Practically Efficient Maximum Biclique Search
Summary: Two exact algorithms for maximum-edge biclique: pivot-based branching with adjacency bounds (worst-case O(m^{1.348n})) and a cover-based method exploiting a new maximal-biclique↔minimal-vertex-cover duality (O(m^{1.381n})). Pruning, heuristics and a pivot/cover hybrid give orders-of-magnitude speedups on dense real bipartite graphs. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Qiangqiang Dai (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Lianpeng Qiao (Beijing Institute of Technology)
- 4. Donghang Cui (Beijing Institute of Technology)
- 5. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{dai_sigmod26,
title = {{Theoretically and Practically Efficient Maximum Biclique Search}},
author = {Dai, Qiangqiang and Li, Rong-Hua and Qiao, Lianpeng and Cui, Donghang and Wang, Guoren},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769833},
url = {https://dl.acm.org/doi/10.1145/3769833},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 590 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.0001605572 |
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD | 9.5408759e-05 |
| 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5574945e-05 |
| 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.0215536e-05 |
| 3,862 | CSV: Visualizing and Mining Cohesive Subgraphs | 2008 | SIGMOD | 7.0665158e-05 |
| 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 6.2418958e-05 |
| 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 2 | 7,731 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB |
| 3 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 4 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 5 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 6 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 7 | 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 8 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 9 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 10 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |