A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs.

Ziyad AlGhamdi Fuad T. Jamour Spiros Skiadopoulos Panos Kalnis

Published in: SSDBM (2017)

Keyphrases

approximation algorithms
betweenness centrality
complex networks
shortest path
undirected graph
special case
np hard
social networks

graph partitioning
vertex cover
real world networks
worst case
set cover
minimum cost
disjoint paths
approximation schemes

primal dual
approximation ratio
randomized algorithms
approximation guarantees
open shop
precedence constraints
graph theory
network structure

social network analysis
graph model
community detection
weighted graph
road network
constant factor
linear programming
computational complexity