Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for updating betweenness centrality in fully dynamic graphs |
scientific article; zbMATH DE number 6870735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for updating betweenness centrality in fully dynamic graphs |
scientific article; zbMATH DE number 6870735 |
Statements
Efficient algorithms for updating betweenness centrality in fully dynamic graphs (English)
0 references
22 May 2018
0 references
betweenness centrality
0 references
update algorithm
0 references
biconnected component
0 references
dynamic graph
0 references
community detection
0 references
0.9350023
0 references
0.9350023
0 references
0.92501974
0 references
0.9163633
0 references
0.91065025
0 references
0.8888259
0 references
