scientific article; zbMATH DE number 6917138

DOI10.4230/LIPICS.SEA.2017.23MaRDI QIDQ4580179zbMATHFDO

Authors Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe

Publication date 13 August 2018

Full work available at URL https://arxiv.org/abs/1704.08592

zbMATH Keywords

distancesshortest pathsgraph algorithmsdynamic algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximating betweenness centrality in large evolving networks
• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• A faster algorithm to update betweenness centrality after node alteration
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Betweenness centrality -- incremental and faster
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Community based node betweenness centrality updating algorithms in dynamic networks
• A faster algorithm for betweenness centrality*
• Fully-dynamic approximation of betweenness centrality

Cited in

(15)

• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Local community detection in dynamic graphs using personalized centrality
• Improving the betweenness centrality of a node by adding links
• Approximating betweenness centrality in large evolving networks
• A faster algorithm to update betweenness centrality after node alteration
• Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
• Optimizing node infiltrations in complex networks by a local search based heuristic
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Betweenness centrality -- incremental and faster
• Computing Betweenness Centrality in Link Streams
• Fully-dynamic approximation of betweenness centrality
• Snapshot centrality indices in dynamic FIFO networks
• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Community based node betweenness centrality updating algorithms in dynamic networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580179)