A parallel closed centrality algorithm for complex networks


Erciyes K.

2nd International Informatics and Software Engineering Conference, IISEC 2021, Ankara, Türkiye, 16 - 17 Aralık 2021, (Tam Metin Bildiri)

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/iisec54230.2021.9672334
  • Basıldığı Şehir: Ankara
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: Betweenness centrality, Closeness centrality, Complex network, Parallel algorithm
  • Maltepe Üniversitesi Adresli: Evet

Özet

Complex networks are large and analysis of these networks require significantly different methods than small networks. Parallel processing is needed to provide analysis of these networks in a timely manner. Graph centrality measures provide convenient methods to assess the structure of these networks. We review main centrality algorithms, describe implementation of closed centrality in Python and propose a simple parallel algorithm of closed centrality and show its implementation in Python with obtained results.