A Fast Algorithm for Streaming Betweenness Centrality

Analysis of social networks is challenging due to the rapid changes of its members and their relationships. For many cases it impractical to recompute the metric of interest, therefore, streaming algorithms are used to reduce the total runtime following modifications to the graph. Centrality is ofte...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Green, O., McColl, R., Bader, D. A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Approximation methods Arrays graph algorithms Heuristic algorithms Social network services social networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!