Searching social networks-dense subgraph discovery

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...

Full description

Saved in:
Bibliographic Details
Main Author: Kannan, Siddharth.
Other Authors: School of Computer Engineering
Format: Final Year Project
Language:English
Published: 2012
Subjects:
DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences
Online Access:http://hdl.handle.net/10356/50185
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary: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.

Similar Items