Distances of Networks and Applications in Graph Mining
Organization
Algorithms & Theory
Abstract
The goal of this thesis is to find a way to apply to directed networks an existing algorithm which computes the "distance" between two undirected networks. It requires a fair amount of coding with directed graphs (strongly connected components and topological sorting, for starters).
The project is done together with the Neuroscience people at ATI, who provide the data sets.
The project is done together with the Neuroscience people at ATI, who provide the data sets.
Graduation Theses defence year
2016-2017
Supervisor
Dirk Oliver Theis
Spoken language (s)
English
Requirements for candidates
C++, Graph Algorithms, ingenuity.
Level
Masters
Keywords
Application of contact
Name
Dirk Oliver Theis
Phone
E-mail