A Survey of Algorithms for Dense Subgraph Discovery

@inproceedings{Lee2010ASO,
  title={A Survey of Algorithms for Dense Subgraph Discovery},
  author={Victor E. Lee and Ning Ruan and Ruoming Jin and Charu C. Aggarwal},
  booktitle={Managing and Mining Graph Data},
  year={2010}
}
In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clustering is largely concerned with that of finding a fixed partition in the data, whereas the problem of dense subgraph discovery defines these dense components in a much more flexible way. The problem of dense subgraph discovery © Springer Science… CONTINUE READING
Highly Cited
This paper has 118 citations. REVIEW CITATIONS

9 Figures & Tables

Topics

Statistics

010203020112012201320142015201620172018
Citations per Year

119 Citations

Semantic Scholar estimates that this publication has 119 citations based on the available data.

See our FAQ for additional information.