An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs
Summary: Unified re-implementation and benchmark of six s-t reliability estimators on uncertain graphs, using consistent datasets, metrics, and workloads. Surprising results: many later algorithms are slower, less accurate, and more memory-hungry than early methods; recommendations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiangyu Ke
- 2. Arijit Khan
- 3. Leroy Lim Hong Quan
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,909 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2722596e-05 |
| 6,164 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.1731827e-05 |
| 8,909 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD | 4.4229886e-05 |
| 9,135 | Sage: A System for Uncertain Network Analysis | 2022 | VLDB | 4.3846727e-05 |
| 9,796 | uBlade: Efficient Batch Processing for Uncertain Graph Queries | 2024 | SIGMOD | 4.2777144e-05 |
| 11,075 | A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs | 2024 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 377 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00025074538 |
| 1,159 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00013584223 |
| 1,448 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011928845 |
| 3,106 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB | 7.5550946e-05 |
| 4,165 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 6.3843974e-05 |
| 5,355 | Discovering Your Selling Points: Personalized Social Influential Tags Exploration | 2017 | SIGMOD | 5.5518336e-05 |
| 6,091 | Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users? | 2016 | SIGMOD | 5.2141312e-05 |
| 6,373 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0875991e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,159 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00013584223 |
| 1,698 | Sensitivity Analysis and Explanations for Robust Query Evaluation in Probabilistic Databases | 2011 | SIGMOD | 0.00010857033 |
| 4,959 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.7992713e-05 |
| 1,448 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011928845 |
| 6,522 | Clustering Uncertain Graphs | 2018 | VLDB | 5.0230003e-05 |
| 4,165 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 6.3843974e-05 |
| 572 | The Complexity of Query Reliability | 1998 | PODS | 0.00019888988 |
| 837 | The reliability of queries (Extended Abstract) | 1995 | PODS | 0.0001603297 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.673504e-05 |
| 6,373 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0875991e-05 |