Login / Signup
Computing top-k Closeness Centrality Faster in Unweighted Graphs.
Elisabetta Bergamini
Michele Borassi
Pierluigi Crescenzi
Andrea Marino
Henning Meyerhenke
Published in:
CoRR (2017)
Keyphrases
</>
social networks
user defined
undirected graph
graph theoretic
degree centrality
graph theory
graph representation
memory efficient
neural network
data structure
special case
network analysis
block max