The spanning tree based approach for solving the shortest path problem in social graphs

The spanning tree based approach for solving the shortest path problem in social graphs

Näytä muut versiot (1)

This thesis is devoted to the shortest path problem in social graphs. Social graphs represent individuals and social relationships between them. As for social networking sites, their users are represented as vertices of the social graph, and the relationship which indicates whether two users are fri...

Täydet tiedot

Bibliografiset tiedot
Päätekijä: Eremeev, Andrei
Muut tekijät: Informaatioteknologian tiedekunta, Faculty of Information Technology, Tietojenkäsittelytieteiden laitos, Department of Computer Science and Information Systems, University of Jyväskylä, Jyväskylän yliopisto
Aineistotyyppi: Pro gradu
Kieli:eng
Julkaistu: 2016
Aiheet:
social graph
social network analysis
shortest path problem
Odnoklassniki
the Atlas algorithm
Ohjelmistotuotanto
601
graafit
algoritmit
sosiaaliset verkostot
sosiaalinen media
Linkit: https://jyx.jyu.fi/handle/123456789/49203

Samankaltaisia teoksia