Login / Signup
Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs.
Mostafa Haghir Chehreghani
Albert Bifet
Talel Abdessalem
Published in:
PAKDD (3) (2018)
Keyphrases
</>
exact and approximate
directed graph
lower bound
betweenness centrality
string matching
learning algorithm
upper bound
databases
object recognition
graphical models
markov chain
graph theory
graph structures
strongly connected