Back to papers
Scalable Approximate Biclique Counting over Large Bipartite Graphs
Summary: Reduce (p,q)-biclique counting to counting (p,q)-brooms — a spanning-tree proxy counted via graph-coloring and efficient dynamic programming. Use DP intermediates for unbiased sampling with provable error bounds; yields up to 8× error reduction and 50× speedup on real bipartite graphs.
(summarized by gpt-5-mini on Mar 13 2026)
- Paper ID
- 14356
- Venue
- VLDB
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,312 | 28.34%
- DOI
-
10.14778/3785297.3785301
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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.00011705344 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 2,908 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.92992e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 4,484 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1426351e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 5,782 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
5.3268721e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4401156e-05 |
| 10,572 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1905499e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,412 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
4.3399748e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1905499e-05 |
| 10,157 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
4.1905499e-05 |
| 3,496 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.0376611e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 7,450 |
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks |
2023 |
SIGMOD |
4.7218383e-05 |
| 2,908 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.92992e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.1905499e-05 |