Back to papers
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks
Summary: Proposes one-sided weighted sampling, a bipartite-specific, unbiased approximate method for counting butterflies (2x2 bicliques) with a nontrivial extension to bi-triangles. Under power-law bipartite graphs, experiments show substantial speedups over exact methods and a fast approximate clustering coefficient estimator with <1% relative error.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6761
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 4.7218383e-05
- Overall Rank
- 7,450 | 48.23%
- DOI
-
10.1145/3626753
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 284 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029014359 |
| 338 |
Influence Maximization in Near-Linear Time: A Martingale Approach |
2015 |
SIGMOD |
0.00026987013 |
| 588 |
Massive Graph Triangulation |
2013 |
SIGMOD |
0.00019588834 |
| 724 |
Meaningful Change Detection in Structured Data |
1997 |
SIGMOD |
0.00017477352 |
| 888 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015549756 |
| 941 |
Wander Join: Online Aggregation via Random Walks |
2016 |
SIGMOD |
0.00015147831 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 2,110 |
HubPPR: Effective Indexing for Approximate Personalized PageRank |
2017 |
VLDB |
9.5280826e-05 |
| 2,291 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0894835e-05 |
| 2,668 |
Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened |
2020 |
SIGMOD |
8.3432296e-05 |
| 2,685 |
Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms |
2016 |
SIGMOD |
8.314724e-05 |
| 2,908 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.92992e-05 |
| 2,913 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9229304e-05 |
| 2,918 |
DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees |
2019 |
VLDB |
7.9043213e-05 |
| 3,370 |
Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed |
2022 |
VLDB |
7.1645471e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,654 |
Dynamic Structural Clustering on Graphs |
2021 |
SIGMOD |
6.0129362e-05 |
| 5,483 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4829054e-05 |
| 5,666 |
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme |
2023 |
SIGMOD |
5.3824583e-05 |
| 6,987 |
Effective Indexing for Dynamic Structural Graph Clustering |
2022 |
VLDB |
4.8669464e-05 |
| 7,915 |
Efficient Approximate Algorithms for Empirical Entropy and Mutual Information |
2021 |
SIGMOD |
4.6135329e-05 |
| 8,609 |
Efficient Dynamic Weighted Set Sampling and Its Extension |
2024 |
VLDB |
4.4810481e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 11,065 |
Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph |
2024 |
VLDB |
4.1905499e-05 |
| 5,782 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
5.3268721e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 10,572 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1905499e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,312 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,484 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1426351e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |