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
- 2. Yue Wang
- 3. Lei Chen
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 |
|---|---|---|---|---|
| 827 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00016220185 |
| 891 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00015564292 |
| 1,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 1,484 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011714263 |
| 2,684 | Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms | 2016 | SIGMOD | 8.3136866e-05 |
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |
| 4,179 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 6.3800553e-05 |
| 6,006 | Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees | 2020 | VLDB | 5.2415551e-05 |
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-05 |
Previous
Page 1 / 1
Next