Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
Summary: Defines MaxBPs: given a bipartite graph, find K maximal k-biplexes with the most edges, without requiring fixed per-side size constraints. Proposes Symmetric-BK branch-and-bound (FastBB, PBIE); achieves O*(gamma_k^n) with gamma_k<2 and O*(gamma_k^d) on sparse graphs; NP-hard; up to 4 orders of magnitude faster than baselines, aiding fraud-detection tasks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kaiqiang Yu
- 2. Cheng Long
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,696 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 5.3673968e-05 |
| 6,532 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 5.0245678e-05 |
| 7,111 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD | 4.8284522e-05 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 1,484 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011714263 |
| 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 |
| 2,903 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.9375744e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 5,696 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 5.3673968e-05 |
| 6,813 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD | 4.9187137e-05 |
| 4,081 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB | 6.4642761e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 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 |
| 10,119 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 4.1945683e-05 |
| 2,521 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6065919e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |