Efficient Algorithms for Maximal k-Biplex Enumeration
Summary: iTraversal, a reverse-search on a solution graph, enumerates all maximal k-biplexes with polynomial delay. It uses an initial solution and pruning to yield a sparse graph (~0.1% of bTraversal) and up to 10^4x speedups on graphs with 1B edges. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kaiqiang Yu (Nanyang Technological University)
- 2. Cheng Long (Nanyang Technological University)
- 3. Shengxin Liu (Harbin Engineering University)
- 4. Da Yan (University of Alabama)
BibTeX Citation
@inproceedings{yu_sigmod22,
title = {{Efficient Algorithms for Maximal k-Biplex Enumeration}},
author = {Yu, Kaiqiang and Long, Cheng and Liu, Shengxin and Yan, Da},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517847},
url = {https://dl.acm.org/doi/10.1145/3514221.3517847},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
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 |
|---|---|---|---|---|
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011648789 |
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD | 9.5408759e-05 |
| 3,608 | Group Recommendation: Semantics and Efficiency | 2009 | VLDB | 7.2609441e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 2 | 4,143 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 3 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 4 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 5 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 6 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 7 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 8 | 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 9 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 10 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |