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
- 2. Rong-Hua Li
- 3. Qiangqiang Dai
- 4. Hongchao Qin
- 5. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,897 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 4.427232e-05 |
| 9,405 | Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy | 2024 | SIGMOD | 4.3441378e-05 |
| 10,078 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 4.1945683e-05 |
| 10,134 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,157 | Efficient and Effective Biclique Counting with Local Differential Privacy | 2026 | SIGMOD | 4.1945683e-05 |
| 10,258 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB | 4.1945683e-05 |
| 10,300 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB | 4.1945683e-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,484 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011714263 |
| 1,570 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011322927 |
| 2,903 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.9375744e-05 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 3,410 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.1253867e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 4,171 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 6.3879236e-05 |
| 4,459 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1651553e-05 |
| 4,898 | On Sampling from Massive Graph Streams | 2017 | VLDB | 5.8459467e-05 |
Previous
Page 1 / 1
Next