Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
Summary: Efficient enumeration of all maximal k-biplexes in bipartite graphs via new branching/pivoting rules. Improves worst-case from O(m^2 n) to O(m α_k n) (and better β_k), plus pruning/reduction optimizations; up to 10^5× faster in experiments. (summarized by gpt-5.4-mini on May 24 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. Donghang Cui (Beijing Institute of Technology)
- 4. Meihao Liao (Beijing Institute of Technology)
- 5. Yu-Xuan Qiu (Shenzhen University)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{dai_sigmod24,
title = {{Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee}},
author = {Dai, Qiangqiang and Li, Rong-Hua and Cui, Donghang and Liao, Meihao and Qiu, Yu-Xuan and Wang, Guoren},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654938},
url = {https://dl.acm.org/doi/10.1145/3654938},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,689 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD | 5.2351259e-05 |
| 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 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 |
| 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 6.3485708e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 2 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 3 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 4 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 5 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 6 | 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 7 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 8 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 9 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 10 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |