Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
Summary: IPS rethinks branch-and-bound biclique enumeration with output-sensitive termination and a matched pivot strategy, improving the worst-case base from √2 to α≈1.3954. An inclusion–exclusion variant further accelerates sparse graphs and outperforms prior methods experimentally. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kaixin Wang (Beijing Institute of Technology)
- 2. Kaiqiang Yu (Nanjing University)
- 3. Cheng Long (Nanyang Technological University)
BibTeX Citation
@inproceedings{wang_sigmod26,
title = {{Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy}},
author = {Wang, Kaixin and Yu, Kaiqiang and Long, Cheng},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802086},
url = {https://dl.acm.org/doi/10.1145/3802086},
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 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 766 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014118259 |
| 1,222 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011463714 |
| 1,788 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD | 9.6317563e-05 |
| 2,320 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6448197e-05 |
| 2,325 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.6310032e-05 |
| 2,743 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.0679908e-05 |
| 3,610 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 7.1643588e-05 |
| 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 6.5021632e-05 |
| 5,500 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 6.1028678e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,045 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 2 | 5,500 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 3 | 2,325 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 4 | 2,320 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 5 | 766 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 6 | 10,599 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 7 | 2,743 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 8 | 10,860 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB |
| 9 | 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 10 | 11,518 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |