The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs
Summary: Proposes deterministic representative instances of uncertain graphs preserving expected vertex degrees to reflect topology. This enables graph analytics on the representative to approximate shortest-path, clustering and betweenness efficiently. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |
| 4,171 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 6.3879236e-05 |
| 6,171 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.170101e-05 |
| 6,172 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 5.170101e-05 |
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-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,580 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB | 4.3234342e-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 |
|---|---|---|---|---|
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 827 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD | 0.00016220185 |
| 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,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.6779082e-05 |
| 4,958 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.8031038e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,211 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3563454e-05 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.6779082e-05 |
| 6,172 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB | 5.170101e-05 |
| 4,958 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.8031038e-05 |
| 1,450 | Distance-Constraint Reachability Computation in Uncertain Graphs | 2011 | VLDB | 0.00011925844 |
| 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 |
| 6,171 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.170101e-05 |
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-05 |
| 6,545 | Clustering Uncertain Graphs | 2018 | VLDB | 5.0193115e-05 |