Figure 2From: BFL: a node and edge betweenness based fast layout algorithm for large scale networksNoise perturbation to betweenness. Run-times of the algorithm when the betweenness information is perturbed. Runtime grows with noise.Back to article page