Login / Signup
Computing Top-k Closeness Centrality in Fully-dynamic Graphs.
Patrick Bisenius
Elisabetta Bergamini
Eugenio Angriman
Henning Meyerhenke
Published in:
CoRR (2017)
Keyphrases
</>
dynamic networks
dynamic environments
network analysis
dynamic graph
query processing
graph matching
data sets
neural network
mobile robot
random walk
social network analysis
graph partitioning
graph theoretic
efficiently computing
betweenness centrality