Login / Signup
Faster computation of successive bounds on the group betweenness centrality.
Derya Dinler
Mustafa Kemal Tural
Published in:
Networks (2018)
Keyphrases
</>
betweenness centrality
complex networks
upper bound
shortest path
social networks
lower bound
graph partitioning
supervised learning
computer vision
training data
object recognition
worst case