Shortest Paths and Centrality in Uncertain Networks
Summary: Uncertain-graph shortest-path queries with probabilistic edges; #P-hardness for a path’s probability and basic properties of the Most Probable Shortest Path (MPSP) are established. Introduces sampling-based, end-to-end accurate algorithms for MPSP; defines a betweenness centrality via MPSPs and validates scalability on sensor and brain networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Arkaprava Saha (Nanyang Technological University)
- 2. Ruben Brokkelkamp (Centrum Wiskunde & Informatica)
- 3. Yllka Velaj (University of Vienna)
- 4. Arijit Khan (Nanyang Technological University)
- 5. Francesco Bonchi (Institute for Scientific Interchange Foundation)
BibTeX Citation
@article{saha_vldb21,
title = {{Shortest Paths and Centrality in Uncertain Networks}},
author = {Saha, Arkaprava and Brokkelkamp, Ruben and Velaj, Yllka and Khan, Arijit and Bonchi, Francesco},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {7},
pages = {1188--1201},
doi = {10.14778/3450980.3450988},
url = {https://doi.org/10.14778/3450980.3450988},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 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 |
| 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 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 199 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.00025522558 |
| 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,632 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 7.1494448e-05 |
| 3,820 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 7.005206e-05 |
| 5,754 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 6.0058421e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,599 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB |
| 2 | 6,988 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB |
| 3 | 5,336 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 4 | 9,914 | Efficient Stochastic Routing in Path-Centric Uncertain Road Networks | 2024 | VLDB |
| 5 | 6,161 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB |
| 6 | 3,632 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 7 | 1,063 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB |
| 8 | 3,820 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD |
| 9 | 6,475 | Clustering Uncertain Graphs | 2018 | VLDB |
| 10 | 9,240 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD |