Fig. 12From: Fast cluster-based computation of exact betweenness centrality in large graphsEfficiency analysis for lyon-road-network graph-\(E_{p=[1,5,10,15,20,25]}\). Comparison with synthetic graphs having similar size (100k and 200k nodes) and with Brandes’ algorithm on the same graphBack to article page