1. Abboud, A., Grandoni, F., Williams, V.V.: Subcubic equivalences between graph centrality problems, APSP and diameter. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2015)
2. Amati, G., Cruciani, A., Angelini, S., Pasquini, D., Vocca, P.: Computing distance-based metrics on very large graphs. CoRR (2023)
3. Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: Risk bounds and structural results. J. Mach. Learn. Res. (2003)
4. Becker, R., Crescenzi, P., Cruciani, A., Kodric, B.: Proxying betweenness centrality rankings in temporal networks. In: 21st International Symposium on Experimental Algorithms, SEA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
5. Borassi, M., Natale, E.: KADABRA is an adaptive algorithm for betweenness via random approximation. ACM J. Exp, Algorithmics (2019)