Searching social networks-dense subgraph discovery
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 comprehen...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/50185 |
| _version_ | 1824454935663607808 |
|---|---|
| author | Kannan, Siddharth. |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Kannan, Siddharth. |
| author_sort | Kannan, Siddharth. |
| collection | NTU |
| description | 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. |
| first_indexed | 2025-02-19T03:30:13Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/50185 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T03:30:13Z |
| publishDate | 2012 |
| record_format | dspace |
| spelling | ntu-10356/501852023-03-03T20:36:42Z Searching social networks-dense subgraph discovery Kannan, Siddharth. School of Computer Engineering Cheng Sheung Chak James DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences 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. Bachelor of Engineering (Computer Science) 2012-05-30T08:59:42Z 2012-05-30T08:59:42Z 2012 2012 Final Year Project (FYP) http://hdl.handle.net/10356/50185 en Nanyang Technological University 49 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences Kannan, Siddharth. Searching social networks-dense subgraph discovery |
| title | Searching social networks-dense subgraph discovery |
| title_full | Searching social networks-dense subgraph discovery |
| title_fullStr | Searching social networks-dense subgraph discovery |
| title_full_unstemmed | Searching social networks-dense subgraph discovery |
| title_short | Searching social networks-dense subgraph discovery |
| title_sort | searching social networks dense subgraph discovery |
| topic | DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences |
| url | http://hdl.handle.net/10356/50185 |
| work_keys_str_mv | AT kannansiddharth searchingsocialnetworksdensesubgraphdiscovery |