Distances of Networks and Applications in Graph Mining
Organisatsiooni nimi
Algorithms & Theory
Kokkuvõte
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.
Lõputöö kaitsmise aasta
2016-2017
Juhendaja
Dirk Oliver Theis
Suhtlemiskeel(ed)
inglise keel
Nõuded kandideerijale
C++, Graph Algorithms, ingenuity.
Tase
Magister
Märksõnad
Kandideerimise kontakt
Nimi
Dirk Oliver Theis
Tel
E-mail