Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ins.2015.07.053 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.INS.2015.07.053 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 11 December 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
