DBScholar

Back to papers

Local Search of Communities in Large Graphs

Summary: Local search strategy for community search in large graphs; confines exploration to a vertex's neighborhood rather than a global traversal. Non-monotonic minimum-degree quality measure complicates local search; the paper proposes theories and algorithms and validates them on synthetic and real networks with millions of nodes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h51754cf1478d7132
Venue
SIGMOD
Year
2014
Pagerank
0.00022377798
Overall Rank
276 | 98.16%
DOI
10.1145/2588555.2612179

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{cui_sigmod14,
        title = {{Local Search of Communities in Large Graphs}},
        author = {Cui, Wanyun and Xiao, Yanghua and Wang, Haixun and Wang, Wei},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2612179},
        url = {https://dl.acm.org/doi/10.1145/2588555.2612179},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 51 citing papers.

Rank Citing Paper Year Venue Pagerank
11,496 Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks 2025 VLDB 4.9605343e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
274 Online Search of Overlapping Communities 2013 SIGMOD 0.00022499515
373 Graph Clustering Based on Structural/Attribute Similarities 2009 VLDB 0.00019709993
1,179 Local Graph Sparsification for Scalable Clustering 2011 SIGMOD 0.00011604775
3,540 Scalable Discovery of Best Clusters on Large Graphs 2010 VLDB 7.1983141e-05
Previous Page 1 / 1 Next

Semantically Similar Papers