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
- 2. Rong-Hua Li
- 3. Lianpeng Qiao
- 4. Donghang Cui
- 5. Guoren Wang
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 |
|---|---|---|---|---|
| 738 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00017435236 |
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 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 |
| 3,480 | CSV: Visualizing and Mining Cohesive Subgraphs | 2008 | SIGMOD | 7.0538737e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 6,532 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 5.0245678e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next