Estimating Biclique Counts with Accuracy Guarantees
Summary: First approximation algorithm for (p,q)-biclique counting with formal error and failure-probability guarantees, using an edge-oriented sampling framework (BC-Shadow) that refines the sample space to increase biclique density and cut sample complexity. Introduces zstar, a one-to-one sampling structure, and an adaptive sampling rule; provides provable accuracy/runtime bounds and scalable empirical validation on large real graphs. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Rashmika Gamage
- 2. Lijun Chang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 10,119 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 4.1945683e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 9,406 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 4.3441378e-05 |
| 4,459 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB | 6.1651553e-05 |
| 10,157 | Efficient and Effective Biclique Counting with Local Differential Privacy | 2026 | SIGMOD | 4.1945683e-05 |
| 2,903 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.9375744e-05 |
| 7,451 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7263711e-05 |
| 4,626 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD | 6.0399035e-05 |
| 10,300 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB | 4.1945683e-05 |