_version_ |
1809901956063297536
|
annif_keywords_txtF_mv |
graphs (network theory)
algorithms
social networks
social media
network theory
|
annif_uris_txtF_mv |
http://www.yso.fi/onto/yso/p26018
http://www.yso.fi/onto/yso/p14524
http://www.yso.fi/onto/yso/p408
http://www.yso.fi/onto/yso/p20774
http://www.yso.fi/onto/yso/p2543
|
author |
Eremeev, Andrei
|
author2 |
Informaatioteknologian tiedekunta
Faculty of Information Technology
Tietojenkäsittelytieteiden laitos
Department of Computer Science and Information Systems
University of Jyväskylä
Jyväskylän yliopisto
Ohjelmistotuotanto
601
|
author_facet |
Eremeev, Andrei
Informaatioteknologian tiedekunta
Faculty of Information Technology
Tietojenkäsittelytieteiden laitos
Department of Computer Science and Information Systems
University of Jyväskylä
Jyväskylän yliopisto
Ohjelmistotuotanto
601
Eremeev, Andrei
|
author_sort |
Eremeev, Andrei
|
building |
Jyväskylän yliopisto
JYX-julkaisuarkisto
|
datasource_str_mv |
jyx
|
department_txtF |
Informaatioteknologia
|
faculty_txtF |
Informaatioteknologian tiedekunta
|
first_indexed |
2023-03-22T09:58:49Z
|
format |
Pro gradu
|
format_ext_str_mv |
Opinnäyte
Pro gradu
|
free_online_boolean |
1
|
fullrecord |
<?xml version="1.0"?>
<qualifieddc schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd"><title>The spanning tree based approach for solving the shortest path problem in social graphs</title><creator>Eremeev, Andrei</creator><contributor type="tiedekunta" lang="fi">Informaatioteknologian tiedekunta</contributor><contributor type="tiedekunta" lang="en">Faculty of Information Technology</contributor><contributor type="laitos" lang="fi">Tietojenkäsittelytieteiden laitos</contributor><contributor type="laitos" lang="en">Department of Computer Science and Information Systems</contributor><contributor type="yliopisto" lang="en">University of Jyväskylä</contributor><contributor type="yliopisto" lang="fi">Jyväskylän yliopisto</contributor><contributor type="oppiaine" lang="fi">Ohjelmistotuotanto</contributor><contributor type="oppiainekoodi">601</contributor><subject type="other">social graph</subject><subject type="other">social network analysis</subject><subject type="other">shortest path problem</subject><subject type="other">Odnoklassniki</subject><subject type="other">the Atlas algorithm</subject><subject type="yso">graafit</subject><subject type="yso">algoritmit</subject><subject type="yso">sosiaaliset verkostot</subject><subject type="yso">sosiaalinen media</subject><available>2016-03-27T21:48:05Z</available><issued>2016</issued><type lang="fi">Pro gradu -tutkielma</type><type lang="en">Master’s thesis</type><identifier type="other">oai:jykdok.linneanet.fi:1525091</identifier><identifier type="uri">https://jyx.jyu.fi/handle/123456789/49203</identifier><identifier type="urn">URN:NBN:fi:jyu-201603281950</identifier><language type="iso">eng</language><rights lang="fi">Julkaisu on tekijänoikeussäännösten alainen. Teosta voi lukea ja tulostaa henkilökohtaista käyttöä varten. Käyttö kaupallisiin tarkoituksiin on kielletty.</rights><rights lang="en">This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.</rights><rights type="accesslevel" lang="fi">openAccess</rights><permaddress type="urn">http://www.urn.fi/URN:NBN:fi:jyu-201603281950</permaddress><file bundle="ORIGINAL" href="https://jyx.jyu.fi/bitstream/123456789/49203/4/URN-NBN-fi-jyu-201603281950.pdf" name="URN-NBN-fi-jyu-201603281950.pdf" type="application/pdf" length="4853296" sequence="4"/><recordID>123456789_49203</recordID></qualifieddc>
|
id |
jyx.123456789_49203
|
language |
eng
|
last_indexed |
2024-09-03T10:51:14Z
|
main_date |
2016-01-01T00:00:00Z
|
main_date_str |
2016
|
online_boolean |
1
|
online_urls_str_mv |
{"url":"https:\/\/jyx.jyu.fi\/bitstream\/123456789\/49203\/4\/URN-NBN-fi-jyu-201603281950.pdf","text":"URN-NBN-fi-jyu-201603281950.pdf","source":"jyx","mediaType":"application\/pdf"}
|
oppiainekoodi_txtF |
601
|
publication_first_indexed |
2016-03-22T09:58:49Z
|
publishDate |
2016
|
record_format |
qdc
|
source_str_mv |
jyx
|
spellingShingle |
Eremeev, Andrei
The spanning tree based approach for solving the shortest path problem in social graphs
social graph
social network analysis
shortest path problem
Odnoklassniki
the Atlas algorithm
graafit
algoritmit
sosiaaliset verkostot
sosiaalinen media
|
subject_txtF |
Kognitiotiede
|
thumbnail |
https://jyu.finna.fi/Cover/Show?source=Solr&id=jyx.123456789_49203&index=0&size=large
|
title |
The spanning tree based approach for solving the shortest path problem in social graphs
|
title_full |
The spanning tree based approach for solving the shortest path problem in social graphs
|
title_fullStr |
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
|
title_full_unstemmed |
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
|
title_short |
The spanning tree based approach for solving the shortest path problem in social graphs
|
title_sort |
spanning tree based approach for solving the shortest path problem in social graphs
|
title_txtP |
The spanning tree based approach for solving the shortest path problem in social graphs
|
topic |
social graph
social network analysis
shortest path problem
Odnoklassniki
the Atlas algorithm
graafit
algoritmit
sosiaaliset verkostot
sosiaalinen media
|
topic_facet |
Odnoklassniki
algoritmit
graafit
shortest path problem
social graph
social network analysis
sosiaalinen media
sosiaaliset verkostot
the Atlas algorithm
|
url |
https://jyx.jyu.fi/handle/123456789/49203
http://www.urn.fi/URN:NBN:fi:jyu-201603281950
|
work_keys_str_mv |
AT eremeevandrei spanningtreebasedapproachforsolvingtheshortestpathprobleminsocialgraphs
AT eremeevandrei thespanningtreebasedapproachforsolvingtheshortestpathprobleminsocialgraphs
|