Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/50185| Title: | Searching social networks-dense subgraph discovery | Authors: | Kannan, Siddharth. | Keywords: | DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences | Issue Date: | 2012 | Abstract: | 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. | URI: | http://hdl.handle.net/10356/50185 | Schools: | School of Computer Engineering | Rights: | Nanyang Technological University | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
| Appears in Collections: | SCSE Student Reports (FYP/IA/PA/PI) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| fyp_report(sid).pdf Restricted Access | 1.25 MB | Adobe PDF | View/Open |
Page view(s) 50
534
Updated on Mar 22, 2025
Download(s)
14
Updated on Mar 22, 2025
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.