Login / Signup
Efficient Exact and Approximate Betweenness Centrality Computation for Temporal Graphs.
Tianming Zhang
Yunjun Gao
Jie Zhao
Lu Chen
Lu Jin
Zhengyi Yang
Bin Cao
Jing Fan
Published in:
WWW (2024)
Keyphrases
</>
exact and approximate
betweenness centrality
lower bound
data sets
social networks
shortest path
complex networks
branch and bound
weighted graph
graph partitioning
string matching
computer vision
objective function
evolutionary algorithm
graphical models
directed graph