Stop the war!
Остановите войну!
for scientists:
default search action
"Computing Top-k Closeness Centrality in Fully Dynamic Graphs."
Eugenio Angriman et al. (2022)
- Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamini, Henning Meyerhenke:
Computing Top-k Closeness Centrality in Fully Dynamic Graphs. Massive Graph Analytics 2022: 161-192
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.