Butterfly Counting on Uncertain Bipartite Graphs
Summary: Formalizes the uncertain butterfly in bipartite graphs and the Uncertain Butterfly Counting problem; presents exact baselines UBFC and an improved IUBFC with lower complexity and pruning heuristics. Also offers two sampling-based approximations UBS and PES for quick count estimates; empirical evaluation across diverse edge-probability distributions demonstrates efficiency and practicality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alexander Zhou (Hong Kong University of Science and Technology)
- 2. Yue Wang (Shenzhen University)
- 3. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{zhou_vldb22,
title = {{Butterfly Counting on Uncertain Bipartite Graphs}},
author = {Zhou, Alexander and Wang, Yue and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {2},
pages = {211--223},
doi = {10.14778/3489496.3489502},
url = {https://doi.org/10.14778/3489496.3489502},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
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 |
|---|---|---|---|---|
| 766 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014111575 |
| 971 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00012766663 |
| 1,064 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012202916 |
| 1,224 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011458287 |
| 2,088 | Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms | 2016 | SIGMOD | 9.064678e-05 |
| 3,633 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 7.1460604e-05 |
| 3,821 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 7.0018898e-05 |
| 6,164 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.8619652e-05 |
| 6,433 | Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees | 2020 | VLDB | 5.7857524e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,141 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB |
| 2 | 4,224 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 3 | 10,578 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD |
| 4 | 11,054 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 5 | 5,560 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD |
| 6 | 10,106 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB |
| 7 | 11,603 | Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph | 2024 | VLDB |
| 8 | 1,224 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB |
| 9 | 3,890 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |
| 10 | 7,608 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |