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

id	sg-ntu-dr.10356-50185
record_format	dspace
spelling	sg-ntu-dr.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
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
language	English
topic	DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences
spellingShingle	DRNTU::Engineering::Computer science and engineering::Computer applications::Social and behavioral sciences Kannan, Siddharth. Searching social networks-dense subgraph discovery
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.
author2	School of Computer Engineering
author_facet	School of Computer Engineering Kannan, Siddharth.
format	Final Year Project
author	Kannan, Siddharth.
author_sort	Kannan, Siddharth.
title	Searching social networks-dense subgraph discovery
title_short	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_sort	searching social networks-dense subgraph discovery
publishDate	2012
url	http://hdl.handle.net/10356/50185
_version_	1759857951719292928

Searching social networks-dense subgraph discovery

Similar Items