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
- 2. Chengfei Liu
- 3. Rui Zhou
- 4. Jiajie Xu
- 5. Jianxin Li
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,626 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD | 6.0399035e-05 |
| 6,532 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD | 5.0245678e-05 |
| 8,809 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 4.4443756e-05 |
| 8,897 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 4.427232e-05 |
| 10,078 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 4.1945683e-05 |
| 10,119 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 4.1945683e-05 |
| 10,530 | Most Similar Biclique Search at Scale | 2025 | VLDB | 4.1945683e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |
| 11,060 | Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs | 2024 | VLDB | 4.1945683e-05 |
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 |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 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,603 | Maximum Co-located Community Search in Large Scale Social Networks | 2018 | VLDB | 8.4666465e-05 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 3,969 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB | 6.5787567e-05 |
| 4,459 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1651553e-05 |
Previous
Page 1 / 1
Next