Affordable Access

Vertex importance extension of betweenness centrality algorithm

  • Hanzelka, Jiří
  • Běloch, Michal
  • Martinovič, Jan
  • Slaninová, Kateřina
Publication Date
Jan 01, 2019
[email protected]ŠB-TUO


Variety of real-life structures can be simplified by a graph. Such simplification emphasizes the structure represented by vertices connected via edges. A common method for the analysis of the vertices importance in a network is betweenness centrality. The centrality is computed using the information about the shortest paths that exist in a graph. This approach puts the importance on the edges that connect the vertices. However, not all vertices are equal. Some of them might be more important than others or have more significant influence on the behavior of the network. Therefore, we introduce the modification of the betweenness centrality algorithm that takes into account the vertex importance. This approach allows the further refinement of the betweenness centrality score to fulfill the needs of the network better. We show this idea on an example of the real traffic network. We test the performance of the algorithm on the traffic network data from the city of Bratislava, Slovakia to prove that the inclusion of the modification does not hinder the original algorithm much. We also provide a visualization of the traffic network of the city of Ostrava, the Czech Republic to show the effect of the vertex importance adjustment. The algorithm was parallelized by MPI ( and was tested on the supercomputer Salomon ( at IT4Innovations National Supercomputing Center, the Czech Republic. / 808 / 72 / 61

Report this publication


Seen <100 times