(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs
Summary: Introduces BCList++ for scalable (p,q)-biclique counting/enumeration in sparse bipartite graphs, reducing worst-case dependence from exp(p+q) to exp(p) or exp(q) via layer anchoring and cost-based selection. Array-based search yields up to 3-order speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jianye Yang (Guangdong University of Technology)
- 2. Yun Peng (Hong Kong Baptist University)
- 3. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@article{yang_vldb22,
title = {{(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs}},
author = {Yang, Jianye and Peng, Yun and Zhang, Wenjie},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {2},
pages = {141--153},
doi = {10.14778/3489496.3489497},
url = {https://doi.org/10.14778/3489496.3489497},
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,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011232263 |
| 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD | 9.5408759e-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 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 3 | 7,731 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB |
| 4 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 5 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 6 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 7 | 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD |
| 8 | 4,143 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 9 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 10 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |