Distance-Constraint Reachability Computation in Uncertain Graphs
Summary: Approximates the #P-complete probability that two vertices are connected within distance d in an uncertain graph. Introduces unequal-probability Horvitz–Thompson and recursive sampling estimators that reduce variance and improve online efficiency over direct sampling. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ruoming Jin (Kent State University)
- 2. Lin Liu (Kent State University)
- 3. Bolin Ding (University of Illinois Urbana-Champaign)
- 4. Haixun Wang (Microsoft)
BibTeX Citation
@article{jin_vldb11,
title = {{Distance-Constraint Reachability Computation in Uncertain Graphs}},
author = {Jin, Ruoming and Liu, Lin and Ding, Bolin and Wang, Haixun},
journal = {PVLDB},
series = {{VLDB} '11},
volume = {4},
number = {9},
pages = {551--562},
doi = {10.14778/2002938.2002941},
url = {https://doi.org/10.14778/2002938.2002941},
year = {2011}
}
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022786599 |
| 679 | GRAIL: Scalable Reachability Index for Large Graphs | 2010 | VLDB | 0.00015055389 |
| 1,049 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012415522 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 2 | 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB |
| 3 | 9,062 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD |
| 4 | 5,889 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB |
| 5 | 6,037 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB |
| 6 | 1,049 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB |
| 7 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 8 | 5,890 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB |
| 9 | 6,345 | Clustering Uncertain Graphs | 2018 | VLDB |
| 10 | 3,738 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD |