Efficient algorithms for updating betweenness centrality in fully dynamic graphs
type: Item
instance of: scholarly article
title: Efficient algorithms for updating betweenness centrality in fully dynamic graphs
zbMATH Open document ID: 1390.05226
author: Min-Joong Lee
author: Chin-Wan Chung
author: Sung Hee Choi
published in: Information Sciences
publication date: 2018-05-22T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6870735
zbMATH Keywords: betweenness centrality
zbMATH Keywords: update algorithm
zbMATH Keywords: biconnected component
zbMATH Keywords: dynamic graph
zbMATH Keywords: community detection
describes a project that uses: Algorithm 447
MaRDI profile type: Publication
full work available at URL: j.ins.2015.07.053
OpenAlex ID: W1439932879
cites work: The university of Florida sparse matrix collection
cites work: Polygonal approximation of digital planar curves through vertex betweenness
cites work: Approximating Betweenness Centrality
cites work: A faster algorithm for betweenness centrality*
cites work: CENTRALITY ESTIMATION IN LARGE NETWORKS
cites work: A new approach to dynamic all pairs shortest paths
cites work: Experimental analysis of dynamic all pairs shortest path algorithms
cites work: Routing betweenness centrality
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Better Approximation of Betweenness Centrality
cites work: A Faster Algorithm to Update Betweenness Centrality after Node Alteration
cites work: CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
cites work: Network Analysis
cites work: Worst-case update times for fully-dynamic all-pairs shortest paths
DOI: 10.1016/J.INS.2015.07.053
Recommended article: A Faster Algorithm to Update Betweenness Centrality After Node Alteration
Recommended article: A Faster Algorithm to Update Betweenness Centrality after Node Alteration
Recommended article: Fully-Dynamic Approximation of Betweenness Centrality
Recommended article: Approximating Betweenness Centrality in Fully Dynamic Networks
Recommended article: Q4580179
Recommended article: Computing Top-k Closeness Centrality in Fully-dynamic Graphs
Recommended article: Q4688896
Recommended article: Q3679232
Recommended article: A faster algorithm for betweenness centrality*
Recommended article: Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
description: scientific article; zbMATH DE number 6870735