4 papers:
KDD-2015-QinLCZ- Locally Densest Subgraph Discovery (LQ, RHL, LC, CZ), pp. 965–974.
- KDD-2013-TsourakakisBGGT #clique #quality
- Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees (CET, FB, AG, FG, MAT), pp. 104–112.
VLDB-2012-BahmaniKV #pipes and filters #streaming- Densest Subgraph in Streaming and MapReduce (BB, RK, SV), pp. 454–465.
STOC-2010-BhaskaraCCFV #approximate #detection- Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph (AB, MC, EC, UF, AV), pp. 201–210.
