Login / Signup
A new betweenness centrality measure based on an algorithm for ranking the nodes of a network.
Taras Agryzkov
José Luis Oliver
Leandro Tortosa
José-Francisco Vicent
Published in:
Appl. Math. Comput. (2014)
Keyphrases
</>
betweenness centrality
complex networks
optimal solution
shortest path
learning algorithm
similarity measure
k means
segmentation algorithm
combinatorial optimization
computer vision
spanning tree
network structure
graph structure
weighted graph
path length
expectation maximization
finding the shortest path