Database Paper Browser

Back to papers

Scalable Discovery of Best Clusters on Large Graphs

Summary: Top Graph Clusters (TopGC) probabilistically searches large edge-weighted directed graphs for their best clusters in linear time. Parallelizable, supports variable-size overlapping clusters, with a tunable memory parameter; up to 70% speedups and better scores on real-world benchmarks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10117
Venue
VLDB
Year
2010
Pagerank
8.5794502e-05
Overall Rank
2,542 | 82.32%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
353 Local Search of Communities in Large Graphs 2014 SIGMOD 0.00026277992
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076637636
Previous Page 1 / 1 Next

Semantically Similar Papers