Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be perfo...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 29; číslo 3; s. 659 - 672
Hlavní autoři:	Jamour, Fuad, Skiadopoulos, Spiros, Kalnis, Panos
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.03.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms Betweenness centrality dynamic graph algorithms Graphs Heuristic algorithms Measurement Memory management Network analysis Parallel algorithms parallel graph algorithms Random access memory Social network services State of the art
ISSN:	1045-9219, 1558-2183
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!