Sökning: "Oscar Englesson"
Hittade 1 uppsats innehållade orden Oscar Englesson.
1. Divisive Betweenness Centrality Clustering on Graphs Weighted by Timestamps
Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Data visualization is important to obtain a better understanding of many networks. However, for larger networks it is hard to perceive the visualization of the network. In order to simplify such visualizations of networks, graph clustering algorithms may be used to identify subgraphs of close vertices and group them together. LÄS MER
Resultatsidor:
1