Skip to main content
Article thumbnail
Location of Repository

A SURVEY OF ALGORITHMS FOR DENSE SUBGRAPH DISCOVERY

By Victor E. Lee, Ning Ruan, Ruoming Jin and Charu Aggarwal

Abstract

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

Publisher: 2014-04-10
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.3622
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://link.springer.com/conte... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.