DBScholar

Back to papers

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)

Paper ID
7619
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,407 | 28.60%
DOI
10.1145/3769833

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers