Login / Signup
DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs.
Mostafa Haghir Chehreghani
Albert Bifet
Talel Abdessalem
Published in:
IEEE BigData (2018)
Keyphrases
</>
np hard
objective function
computational complexity
expectation maximization
learning algorithm
graph structure
graph partitioning
information retrieval
simulated annealing
graph model
spanning tree
betweenness centrality