Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
Revision as of 01:04, 1 March 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
