Comparing the speed and accuracy of approaches to betweenness centrality approximation

Computational Social Networks

Table 6 Initial testing of four algorithms on the Enron dataset

#	Name	Parameter	Time (s)
1	Brandes [18]	\(\hbox {Samples} = 500\)	12
2	Bader [19]	\(\hbox {Constant}=5\), \(\hbox {Node} = 1022\)	430
3	Pfeffer and Carley [23]	\(\hbox {Hops} = 4\)	742
3	Everett and Borgatti [24]	No parameters	257