scientific article; zbMATH DE number 6917138
From MaRDI portal
Publication:4580179
DOI10.4230/LIPICS.SEA.2017.23zbMATH Open1433.68277arXiv1704.08592MaRDI QIDQ4580179FDOQ4580179
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
Title of this publication is not available (Why is that?)
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (8)
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Optimizing node infiltrations in complex networks by a local search based heuristic
- A Faster Algorithm to Update Betweenness Centrality after Node Alteration
- Approximating Betweenness Centrality in Fully Dynamic Networks
- Computing Betweenness Centrality in Link Streams
- Snapshot centrality indices in dynamic FIFO networks
- Improving the Betweenness Centrality of a Node by Adding Links
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)
