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 (Nanyang Technological University)
- 2. Arijit Khan (Nanyang Technological University)
- 3. Leroy Lim Hong Quan (Nanyang Technological University)
BibTeX Citation
@article{ke_vldb19,
title = {{An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs}},
author = {Ke, Xiangyu and Khan, Arijit and Quan, Leroy Lim Hong},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {8},
pages = {864--876},
doi = {10.14778/3324301.3324304},
url = {https://doi.org/10.14778/3324301.3324304},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,732 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 6.4461271e-05 |
| 5,951 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.9366845e-05 |
| 9,240 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD | 5.2056825e-05 |
| 9,452 | Sage: A System for Uncertain Network Analysis | 2022 | VLDB | 5.1745448e-05 |
| 10,132 | uBlade: Efficient Batch Processing for Uncertain Graph Queries | 2024 | SIGMOD | 5.0751052e-05 |
| 10,813 | X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs | 2026 | VLDB | 4.9793485e-05 |
| 11,604 | A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs | 2024 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 382 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019485934 |
| 1,063 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012208695 |
| 1,260 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011296964 |
| 3,036 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB | 7.731521e-05 |
| 3,820 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 7.005206e-05 |
| 5,301 | Discovering Your Selling Points: Personalized Social Influential Tags Exploration | 2017 | SIGMOD | 6.189668e-05 |
| 5,823 | Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users? | 2016 | SIGMOD | 5.9821401e-05 |
| 6,161 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.8647415e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,063 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB |
| 2 | 1,615 | Sensitivity Analysis and Explanations for Robust Query Evaluation in Probabilistic Databases | 2011 | SIGMOD |
| 3 | 4,969 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB |
| 4 | 1,260 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB |
| 5 | 6,475 | Clustering Uncertain Graphs | 2018 | VLDB |
| 6 | 3,820 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD |
| 7 | 658 | The Complexity of Query Reliability | 1998 | PODS |
| 8 | 2,130 | The reliability of queries (Extended Abstract) | 1995 | PODS |
| 9 | 3,604 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB |
| 10 | 6,161 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB |