Distance-Constraint Reachability Computation in Uncertain Graphs
Summary: Distance-Constraint Reachability (DCR) in uncertain graphs: probability dist(s,t) ≤ d; #P-Complete, motivating approximation. Two estimators - Horvitz-Thomson unequal sampling and a recursive sampling method blending deterministic recursion with sampling - achieve lower variance and higher efficiency, validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ruoming Jin
- 2. Lin Liu
- 3. Bolin Ding
- 4. Haixun Wang
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 |
|---|---|---|---|---|
| 270 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022892419 |
| 671 | GRAIL: Scalable Reachability Index for Large Graphs | 2010 | VLDB | 0.0001525358 |
| 1,032 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012602512 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 736 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.0001459447 |
| 3,246 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 7.6740413e-05 |
| 8,934 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD | 5.4076395e-05 |
| 5,801 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 6.1430353e-05 |
| 5,951 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 6.0919742e-05 |
| 1,032 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.00012602512 |
| 2,449 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 8.6321542e-05 |
| 5,802 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 6.1430353e-05 |
| 6,266 | Clustering Uncertain Graphs | 2018 | VLDB | 5.9974199e-05 |
| 3,675 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 7.2707439e-05 |