Dažādas pieejas grafa virsotņu centralitātes noteikšanai
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Darbā tiek analizēti grafu virsotņu centralitātes mēri, kuri tiek aprēķināti pēc trīs zināmiem principiem – pakāpju centralitāti, starpcentralitāti un tuvuma centralitāi Papildus tiek apskatīta modificēta Maiersona vērtības formula, kura ir pielāgota kooperatīvo spēļu ar komunikāciju struktūru spēlētāju centralitātes noteikšanai. Tā tiek pielietota neorientētā grafa gadījumā. Darba noslēgumā tiek analizēts transporta tīkls, nosakot nozīmīgāko valsti kuģa kursēšanas maršrutā.
In this work the centralities of edges in graphs are analyzed and are calculated according to three well known principles - degree centrality, betweenness centrality and closeness centrality. Additionally the Myerson value modification is adapted to determine the centrality of players in cooperative game structures. The modification is used in cases where the graph is non-oriented. At the end of the work a transport network is analyzed with a goal of finding the most central country in the network.
In this work the centralities of edges in graphs are analyzed and are calculated according to three well known principles - degree centrality, betweenness centrality and closeness centrality. Additionally the Myerson value modification is adapted to determine the centrality of players in cooperative game structures. The modification is used in cases where the graph is non-oriented. At the end of the work a transport network is analyzed with a goal of finding the most central country in the network.