Clustering Uncertain Graphs
Summary: Clustering uncertain graphs G=(V,E,p) into k clusters with a designated center per cluster to maximize min/average center-connectivity in a random world. NP-hard to maximize the min, even with an oracle; delivers efficient provable-approximation algorithms (plus variants) with tunable granularity and empirical evaluation. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Matteo Ceccarello
- 2. Carlo Fantozzi
- 3. Andrea Pietracaprina
- 4. Geppino Pucci
- 5. Fabio Vandin
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |
| 4,083 | Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially | 2019 | VLDB | 6.4638932e-05 |
| 9,135 | Sage: A System for Uncertain Network Analysis | 2022 | VLDB | 4.3888791e-05 |
| 10,670 | X-Blossom: Massive Parallelization of Graph Maximum Matching | 2025 | VLDB | 4.1945683e-05 |
| 11,259 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 62 | Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge | 2008 | SIGMOD | 0.0006429466 |
| 101 | ULDBs: Databases with Uncertainty and Lineage | 2006 | VLDB | 0.0004955674 |
| 337 | Influence Maximization in Near-Linear Time: A Martingale Approach | 2015 | SIGMOD | 0.00027011645 |
| 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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,923 | k-Clustering with Comparison and Distance Oracles | 2024 | PODS | 4.1945683e-05 |
| 12,299 | Exceeding Expectations and Clustering Uncertain Data | 2009 | PODS | 4.1945683e-05 |
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 6,019 | Uncertain Centroid based Partitional Clustering of Uncertain Data | 2012 | VLDB | 5.2415551e-05 |
| 6,171 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.170101e-05 |
| 1,860 | Approximation Algorithms for Clustering Uncertain Data | 2008 | PODS | 0.0001028857 |
| 1,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-05 |
| 4,179 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 6.3800553e-05 |
| 3,636 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB | 6.8976555e-05 |