Fully-dynamic approximation of betweenness centrality (Q3452779)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6511766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully-dynamic approximation of betweenness centrality |
scientific article; zbMATH DE number 6511766 |
Statements
Fully-Dynamic Approximation of Betweenness Centrality (English)
0 references
19 November 2015
0 references
betweenness centrality
0 references
algorithmic network analysis
0 references
fully-dynamic graph algorithms
0 references
approximation algorithms
0 references
shortest paths
0 references
0.959035098552704
0 references
0.9119025468826294
0 references
0.8665722012519836
0 references
0.8298436999320984
0 references
