A parallel closed centrality algorithm for complex networks
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Ieee
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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.
Açıklama
2nd International Informatics and Software Engineering Conference (IISEC) - Artificial Intelligence for Digital Transformation -- DEC 16-17, 2021 -- Ankara, TURKEY
Anahtar Kelimeler
Complex Network, Closeness Centrality, Betweenness Centrality, Parallel Algorithm
Kaynak
2nd International Informatics And Software Engineering Conference (Iisec)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
