1. Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Exp. Math. 10(1), 53–66 (2001)
2. Al-Baghdadi, A.: Computing Top-K Closeness Centrality in Unweighted Undirected Graphs Revisited. Ph.D. thesis (2017)
3. Bargigli, L., Gallegati, M.: Finding communities in credit networks. Economics 7(17), 1 (2013)
4. Bavelas, A.: Communication Patterns in Task-Oriented Groups. J. Acoust. Soc. Am. 22(6), 725–730 (1950)
5. Bergamini, E., Borassi, M., Crescenzi, P., Marino, A., Meyerhenke, H.: Computing top-k closeness centrality faster in unweighted graphs. In: Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX), vol. V, pp. 68–80 (2016)