Database Paper Browser

Back to papers

Efficient and Effective Algorithms for Clustering Uncertain Graphs

Summary: Clustering graphs with edge uncertainty under k-median and k-center objectives, maximizing probability to cluster centers. Gives (1-1/e)-approx for k-median and OPT_ck-approx to k-center; practical optimizations; experiments show speed and quality gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11995
Venue
VLDB
Year
2019
Pagerank
6.8976555e-05
Overall Rank
3,636 | 74.71%
DOI
10.14778/3311880.3311884

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers