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
- 2. Ruben Brokkelkamp
- 3. Yllka Velaj
- 4. Arijit Khan
- 5. Francesco Bonchi
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 8,907 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD | 4.427232e-05 |
| 9,135 | Sage: A System for Uncertain Network Analysis | 2022 | VLDB | 4.3888791e-05 |
| 9,793 | uBlade: Efficient Batch Processing for Uncertain Graph Queries | 2024 | SIGMOD | 4.2818172e-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 |
|---|---|---|---|---|
| 180 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.00037135181 |
| 1,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 1,450 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011925844 |
| 3,101 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB | 7.5598015e-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,172 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 5.170101e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,064 | Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks | 2024 | VLDB | 4.1945683e-05 |
| 6,494 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.0417258e-05 |
| 5,597 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB | 5.4178241e-05 |
| 11,046 | Efficient Stochastic Routing in Path-Centric Uncertain Road Networks | 2024 | VLDB | 4.1945683e-05 |
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-05 |
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |
| 1,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 4,179 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 6.3800553e-05 |
| 6,545 | Clustering Uncertain Graphs | 2018 | VLDB | 5.0193115e-05 |
| 8,907 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD | 4.427232e-05 |