Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs
Summary: Introduces unilateral coreness, order, convergence (zeta) to exploit sparsity for MBE in large bipartite graphs. Yields O*(2^zeta)-time MBE with batch-pivots and space-efficient subgraphs, delivering faster, scalable performance on sparse graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lu Chen (Swinburne University of Technology)
- 2. Chengfei Liu (Swinburne University of Technology)
- 3. Rui Zhou (Swinburne University of Technology)
- 4. Jiajie Xu (Soochow University)
- 5. Jianxin Li (Deakin University)
BibTeX Citation
@article{chen_vldb22,
title = {{Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs}},
author = {Chen, Lu and Liu, Chengfei and Zhou, Rui and Xu, Jiajie and Li, Jianxin},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {8},
pages = {1559--1571},
doi = {10.14778/3529337.3529341},
url = {https://doi.org/10.14778/3529337.3529341},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 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,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD | 9.5408759e-05 |
| 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.2907829e-05 |
| 2,106 | Maximum Co-located Community Search in Large Scale Social Networks | 2018 | VLDB | 9.1568079e-05 |
| 3,395 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB | 7.44939e-05 |
| 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.9679551e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 2 | 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 3 | 4,143 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 4 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 5 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 6 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 7 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 8 | 7,731 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB |
| 9 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 10 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |