Efficient Biclique Counting in Large Bipartite Graphs
Summary: EPivoter: an exact edge-pivoting algorithm that counts all (p, q)-bicliques in bipartite graphs without exhaustive enumeration. A DP-based h-zigzag sampling method yields provable approximations for all (p, q), and a hybrid exact-plus-sampling framework delivers orders-of-magnitude speedups on real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaowei Ye (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Qiangqiang Dai (Beijing Institute of Technology)
- 4. Hongchao Qin (Beijing Institute of Technology)
- 5. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{ye_sigmod23,
title = {{Efficient Biclique Counting in Large Bipartite Graphs}},
author = {Ye, Xiaowei and Li, Rong-Hua and Dai, Qiangqiang and Qin, Hongchao and Wang, Guoren},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588932},
url = {https://dl.acm.org/doi/10.1145/3588932},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 5.3251649e-05 |
| 9,557 | Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy | 2024 | SIGMOD | 5.2528121e-05 |
| 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 5.093636e-05 |
| 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,446 | Efficient and Effective Biclique Counting with Local Differential Privacy | 2026 | SIGMOD | 5.093636e-05 |
| 10,546 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB | 5.093636e-05 |
| 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
| 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.2907829e-05 |
| 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.7939844e-05 |
| 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.0215536e-05 |
| 3,028 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.8349117e-05 |
| 3,723 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 7.1725638e-05 |
| 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.9679551e-05 |
| 4,613 | On Sampling from Massive Graph Streams | 2017 | VLDB | 6.6071509e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 2 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 3 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 4 | 5,374 | Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches | 2023 | SIGMOD |
| 5 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 6 | 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |
| 7 | 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD |
| 8 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 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 |