Login / Signup
ACM SRC poster: a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks.
Sanjukta Bhowmick
Vyacheslav V. Rykov
Vladimir Ufimtsev
Published in:
SC Companion (2011)
Keyphrases
</>
optimal solution
k means
learning algorithm
simulated annealing
clustering algorithm
expectation maximization
betweenness centrality
similarity measure
multiscale
probabilistic model
natural images
clustering method
tree structure
group testing