Algorithms for Complex Networks

Networks play a central role in many sectors employing information technology, such as communication, mobility, and transport, social interactions and political activities. Its complex and nearly incomprehensible entanglements of various structures and its huge effect on seemingly unrelated institutions and organizations, the need to understand large networks, their complex structures, and the processes governing them is becoming very important for many application areas and use cases, such as recommender systems, overlapping communities, mobile communities, multimedia networks, software artifact networks, software repositories, digital libraries, web 2.0 artifacts, XMPP protocol artifacts, innovation networks and learning networks. To analyze existing large and complex networks and to design new and more efficient algorithms for solving various problems on these networks is an important task since many of them have become so large and complex that classical algorithms are not sufficient anymore. This seminar tries to get an overview on existing algorithms and open research challenges leading to future research to be carried out in master thesis and Phd thesis work.

Course dates

Prerequisites

There will be a introductory meeting on April 14, 3 pm in the seminar room of i5 (6202).