Login / Signup
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs.
Mostafa Haghir Chehreghani
Albert Bifet
Talel Abdessalem
Published in:
Fundam. Informaticae (2021)
Keyphrases
</>
exact and approximate
directed graph
social networks
combinatorial optimization
data clustering
strongly connected
betweenness centrality
database
object recognition
dynamic programming
query language
markov chain
random walk
shortest path
distance function