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
- 2. Rong-Hua Li
- 3. Donghang Cui
- 4. Meihao Liao
- 5. Yu-Xuan Qiu
- 6. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,119 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 4.1945683e-05 |
| 10,373 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD | 4.1945683e-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,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011013428 |
| 2,521 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6065919e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 5,124 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 5.6795646e-05 |
Previous
Page 1 / 1
Next