DBScholar

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
10308
Venue
VLDB
Year
2010
Pagerank
7.3556982e-05
Overall Rank
3,511 | 75.92%
DOI
10.14778/1920841.1920929

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{macropol_vldb10,
        title = {{Scalable Discovery of Best Clusters on Large Graphs}},
        author = {Macropol, Kathy and Singh, Ambuj},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        pages = {693--702},
        doi = {10.14778/1920841.1920929},
        url = {https://doi.org/10.14778/1920841.1920929},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
276 Local Search of Communities in Large Graphs 2014 SIGMOD 0.00022620623
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
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
Previous Page 1 / 1 Next

Semantically Similar Papers