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
- 5.1725247e-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,031 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00012615956 |
| 1,352 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.0001116702 |
| 2,312 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.8466711e-05 |
| 2,498 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
8.5660152e-05 |
| 3,670 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
7.2766367e-05 |
| 3,885 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
7.1048095e-05 |
| 4,075 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.9825002e-05 |
| 5,371 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
6.3147556e-05 |
| 8,695 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
5.4478131e-05 |
| 10,572 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
5.1725247e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,407 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
5.3341661e-05 |
| 10,962 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
5.1725247e-05 |
| 10,157 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
5.1725247e-05 |
| 3,121 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.7909091e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
5.1725247e-05 |
| 4,018 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
7.0241264e-05 |
| 7,348 |
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks |
2023 |
SIGMOD |
5.695002e-05 |
| 2,498 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
8.5660152e-05 |
| 4,075 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.9825002e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
5.1725247e-05 |