Login / Signup
Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs.
Mostafa Haghir Chehreghani
Albert Bifet
Talel Abdessalem
Published in:
CoRR (2017)
Keyphrases
</>
exact and approximate
directed graph
lower bound
string matching
betweenness centrality
relational databases
databases
learning algorithm
social networks
decision trees
optimization problems
data management
random walk
query evaluation
graph theory
directed acyclic graph