![]() |
![]() |
![]() |
|
|
|
|
Project 16. Analyzing community structure of massive networks
Imagine World Wide
Web (WWW) as a massive network where nodes
correspond to web pages and edges correspond to
links between these web pages.
This project aims to experimentally evaluate algorithms for analyzing such massive networks. These algorithms are challenging because they give useful information about the structure of such networks at the expense of limited space (memory).
Picture source : Wikimedia commons Goals in this project are the following:
Student(s) involved in this project must be familiar with data structures and algorithms. On the other hand they must have a good programming skill in C/C++.
For more information, contact Dr. Rahul Tripathi.
|