DBScholar

Back to papers

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)

Paper ID
10474
Venue
VLDB
Year
2011
Pagerank
0.0001147266
Overall Rank
1,254 | 91.40%
DOI
10.14778/2002938.2002941

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
2,323 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 8.750808e-05
2,575 K-Reach: Who is in Your Small World 2012 VLDB 8.3982298e-05
2,977 Injecting Uncertainty in Graphs for Identity Obfuscation 2012 VLDB 7.9035901e-05
3,278 Simple, Fast, and Scalable Reachability Oracle 2013 VLDB 7.5712342e-05
3,548 Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases 2012 VLDB 7.3214417e-05
3,559 Efficient and Effective Algorithms for Clustering Uncertain Graphs 2019 VLDB 7.3095916e-05
3,738 The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs 2014 SIGMOD 7.1602939e-05
5,192 Discovering Your Selling Points: Personalized Social Influential Tags Exploration 2017 SIGMOD 6.3263349e-05
5,556 Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach 2022 SIGMOD 6.1751704e-05
5,866 Querying Uncertain Data with Aggregate Constraints 2011 SIGMOD 6.0615445e-05
5,889 Shortest Paths and Centrality in Uncertain Networks 2021 VLDB 6.0496722e-05
5,890 An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs 2019 VLDB 6.0496722e-05
6,037 On Uncertain Graphs Modeling and Queries 2015 VLDB 5.9990983e-05
6,345 Clustering Uncertain Graphs 2018 VLDB 5.9059861e-05
7,588 Spheres of Influence for More Effective Viral Marketing 2016 SIGMOD 5.5907856e-05
9,062 Shortest Paths Discovery in Uncertain Networks via Transfer Learning 2023 SIGMOD 5.3251649e-05
9,281 Sage: A System for Uncertain Network Analysis 2022 VLDB 5.2933125e-05
9,665 ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs 2020 VLDB 5.2406724e-05
9,948 uBlade: Efficient Batch Processing for Uncertain Graph Queries 2024 SIGMOD 5.1915905e-05
11,254 Efficient Stochastic Routing in Path-Centric Uncertain Road Networks 2024 VLDB 5.093636e-05
11,458 Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem 2023 VLDB 5.093636e-05
12,103 Indexing Metric Uncertain Data for Range Queries 2015 SIGMOD 5.093636e-05
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