Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for updating betweenness centrality in fully dynamic graphs |
scientific article |
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
