A Faster Algorithm for Betweenness Centrality Based on Adjacency Matrices

Betweenness centrality is essential in complex network analysis; it characterizes the importance of nodes and edges in networks. It is a crucial problem that exactly computes the betweenness centrality in large networks faster, which urgently needs to be solved. We propose a novel algorithm for betw...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-06
Hauptverfasser:	Feng, Yelai, Wang, Huaixi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Complexity Network analysis Nodes
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!