Searching social networks-dense subgraph discovery

Kannan, Siddharth. · DR-NTU (Nanyang Technological University) · 2012

In this project we present a survey of algorithms implemented to assist maximal dense subgraph discovery. These algorithms are implemented on graphs mimicking properties of social networks. The algorithms presented tackle different density measures used for subgraph discovery and provide a comprehensive study of the problem.

Read the paper · More papers on PaperTik