<table><thead><tr><th rowspan="3">Network</th><th colspan="10">Kendall's τ</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="2">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFo</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>0.79</td><td>0.72</td><td>0.92</td><td>0.83</td><td>0.63</td><td>0.76</td><td>0.82</td><td>0.78</td><td>0.72</td><td>0.84</td></tr><tr><td>Venice</td><td>0.84</td><td>0.77</td><td>0.91</td><td>0.83</td><td>0.69</td><td>0.79</td><td>0.84</td><td>0.82</td><td>0.80</td><td>0.87</td></tr><tr><td>Bordeaux</td><td>0.78</td><td>0.66</td><td>0.95</td><td>0.80</td><td>0.59</td><td>0.76</td><td>0.86</td><td>0.69</td><td>0.68</td><td>0.82</td></tr><tr><td>Berlin</td><td>0.64</td><td>0.53</td><td>0.89</td><td>0.70</td><td>0.38</td><td>0.59</td><td>0.77</td><td>0.59</td><td>0.50</td><td>0.70</td></tr><tr><td>Rome</td><td>0.76</td><td>0.61</td><td>0.95</td><td>0.77</td><td>0.53</td><td>0.74</td><td>0.85</td><td>0.64</td><td>0.61</td><td>0.78</td></tr><tr><td>Paris</td><td>0.89</td><td>0.82</td><td>0.97</td><td>0.89</td><td>0.78</td><td>0.88</td><td>0.93</td><td>0.83</td><td>0.82</td><td>0.90</td></tr></tbody></table>

<table><thead><tr><th rowspan="3">Network</th><th colspan="10">Weighted Kendall's τ</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="2">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFo</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>0.88</td><td>0.83</td><td>0.96</td><td>0.90</td><td>0.75</td><td>0.86</td><td>0.89</td><td>0.88</td><td>0.83</td><td>0.91</td></tr><tr><td>Venice</td><td>0.93</td><td>0.85</td><td>0.94</td><td>0.91</td><td>0.79</td><td>0.86</td><td>0.88</td><td>0.91</td><td>0.91</td><td>0.94</td></tr><tr><td>Bordeaux</td><td>0.91</td><td>0.86</td><td>0.98</td><td>0.93</td><td>0.83</td><td>0.91</td><td>0.94</td><td>0.88</td><td>0.88</td><td>0.93</td></tr><tr><td>Berlin</td><td>0.86</td><td>0.82</td><td>0.96</td><td>0.91</td><td>0.65</td><td>0.75</td><td>0.86</td><td>0.85</td><td>0.83</td><td>0.91</td></tr><tr><td>Rome</td><td>0.90</td><td>0.83</td><td>0.98</td><td>0.92</td><td>0.73</td><td>0.89</td><td>0.93</td><td>0.86</td><td>0.85</td><td>0.92</td></tr><tr><td>Paris</td><td>0.96</td><td>0.91</td><td>0.99</td><td>0.96</td><td>0.89</td><td>0.95</td><td>0.97</td><td>0.92</td><td>0.92</td><td>0.97</td></tr></tbody></table>

<table><caption>Table 23: $\beta$ = 1200 and Kendall, weighted Kendall, and intersection correlation</caption><thead><tr><th rowspan="3">Network</th><th colspan="10">Intersection top-100</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="2">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFo</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>75</td><td>73</td><td>96</td><td>84</td><td>61</td><td>73</td><td>75</td><td>75</td><td>75</td><td>86</td></tr><tr><td>Venice</td><td>78</td><td>59</td><td>77</td><td>70</td><td>46</td><td>63</td><td>58</td><td>75</td><td>79</td><td>87</td></tr><tr><td>Bordeaux</td><td>76</td><td>66</td><td>96</td><td>88</td><td>63</td><td>79</td><td>83</td><td>70</td><td>70</td><td>92</td></tr><tr><td>Berlin</td><td>74</td><td>59</td><td>92</td><td>86</td><td>47</td><td>70</td><td>67</td><td>61</td><td>64</td><td>92</td></tr><tr><td>Rome</td><td>59</td><td>50</td><td>84</td><td>63</td><td>32</td><td>49</td><td>60</td><td>58</td><td>49</td><td>68</td></tr><tr><td>Paris</td><td>73</td><td>55</td><td>96</td><td>84</td><td>42</td><td>71</td><td>78</td><td>55</td><td>54</td><td>84</td></tr></tbody></table>
<table><thead><tr><th rowspan="3">Network</th><th colspan="10">Kendall's τ</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="3">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>0.80</td><td>0.68</td><td>0.92</td><td>0.84</td><td>0.61</td><td>0.76</td><td>0.81</td><td>0.73</td><td>0.70</td><td>0.85</td><td></td></tr><tr><td>Venice</td><td>0.84</td><td>0.72</td><td>0.91</td><td>0.82</td><td>0.65</td><td>0.79</td><td>0.83</td><td>0.77</td><td>0.76</td><td>0.86</td><td></td></tr><tr><td>Bordeaux</td><td>0.79</td><td>0.65</td><td>0.95</td><td>0.82</td><td>0.60</td><td>0.78</td><td>0.86</td><td>0.69</td><td>0.69</td><td>0.83</td><td></td></tr><tr><td>Berlin</td><td>0.65</td><td>0.51</td><td>0.89</td><td>0.70</td><td>0.37</td><td>0.59</td><td>0.77</td><td>0.57</td><td>0.49</td><td>0.71</td><td></td></tr><tr><td>Rome</td><td>0.77</td><td>0.60</td><td>0.95</td><td>0.77</td><td>0.53</td><td>0.75</td><td>0.85</td><td>0.64</td><td>0.61</td><td>0.79</td><td></td></tr><tr><td>Paris</td><td>0.89</td><td>0.81</td><td>0.97</td><td>0.89</td><td>0.77</td><td>0.88</td><td>0.93</td><td>0.82</td><td>0.81</td><td>0.90</td><td></td></tr></tbody></table>

<table><thead><tr><th rowspan="3">Network</th><th colspan="10">Weighted Kendall's τ</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="3">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>0.89</td><td>0.76</td><td>0.96</td><td>0.91</td><td>0.68</td><td>0.86</td><td>0.89</td><td>0.81</td><td>0.78</td><td>0.92</td><td></td></tr><tr><td>Venice</td><td>0.93</td><td>0.83</td><td>0.94</td><td>0.91</td><td>0.76</td><td>0.85</td><td>0.87</td><td>0.88</td><td>0.89</td><td>0.94</td><td></td></tr><tr><td>Bordeaux</td><td>0.92</td><td>0.86</td><td>0.98</td><td>0.93</td><td>0.83</td><td>0.92</td><td>0.94</td><td>0.88</td><td>0.89</td><td>0.94</td><td></td></tr><tr><td>Berlin</td><td>0.86</td><td>0.81</td><td>0.96</td><td>0.91</td><td>0.63</td><td>0.75</td><td>0.86</td><td>0.84</td><td>0.82</td><td>0.91</td><td></td></tr><tr><td>Rome</td><td>0.91</td><td>0.83</td><td>0.98</td><td>0.92</td><td>0.73</td><td>0.89</td><td>0.94</td><td>0.86</td><td>0.85</td><td>0.92</td><td></td></tr><tr><td>Paris</td><td>0.96</td><td>0.91</td><td>0.99</td><td>0.96</td><td>0.89</td><td>0.95</td><td>0.97</td><td>0.92</td><td>0.92</td><td>0.97</td><td></td></tr></tbody></table>

<table><caption>Table 24: $\beta$ = 2400 and Kendall, weighted Kendall, and intersection correlation</caption><thead><tr><th rowspan="3">Network</th><th colspan="10">Intersection top-100</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="3">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>77</td><td>65</td><td>95</td><td>86</td><td>58</td><td>75</td><td>78</td><td>68</td><td>68</td><td>88</td><td></td></tr><tr><td>Venice</td><td>76</td><td>58</td><td>77</td><td>71</td><td>43</td><td>62</td><td>61</td><td>72</td><td>76</td><td>86</td><td></td></tr><tr><td>Bordeaux</td><td>78</td><td>63</td><td>96</td><td>87</td><td>62</td><td>81</td><td>83</td><td>67</td><td>68</td><td>90</td><td></td></tr><tr><td>Berlin</td><td>73</td><td>56</td><td>92</td><td>86</td><td>44</td><td>70</td><td>68</td><td>58</td><td>61</td><td>91</td><td></td></tr><tr><td>Rome</td><td>59</td><td>50</td><td>83</td><td>60</td><td>30</td><td>48</td><td>59</td><td>58</td><td>48</td><td>64</td><td></td></tr><tr><td>Paris</td><td>71</td><td>56</td><td>96</td><td>82</td><td>49</td><td>68</td><td>80</td><td>56</td><td>53</td><td>83</td><td></td></tr></tbody></table>
<table><thead><tr><th rowspan="3">Network</th><th colspan="10">Kendall's τ</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="3">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>0.80</td><td>0.65</td><td>0.92</td><td>0.84</td><td>0.58</td><td>0.76</td><td>0.80</td><td>0.70</td><td>0.67</td><td>0.85</td><td></td></tr><tr><td>Venice</td><td>0.83</td><td>0.67</td><td>0.91</td><td>0.81</td><td>0.61</td><td>0.78</td><td>0.82</td><td>0.73</td><td>0.72</td><td>0.85</td><td></td></tr><tr><td>Bordeaux</td><td>0.80</td><td>0.64</td><td>0.95</td><td>0.81</td><td>0.59</td><td>0.78</td><td>0.85</td><td>0.67</td><td>0.68</td><td>0.83</td><td></td></tr><tr><td>Berlin</td><td>0.64</td><td>0.49</td><td>0.89</td><td>0.70</td><td>0.37</td><td>0.59</td><td>0.76</td><td>0.55</td><td>0.48</td><td>0.71</td><td></td></tr><tr><td>Rome</td><td>0.77</td><td>0.60</td><td>0.95</td><td>0.77</td><td>0.53</td><td>0.75</td><td>0.86</td><td>0.63</td><td>0.61</td><td>0.79</td><td></td></tr><tr><td>Paris</td><td>0.89</td><td>0.80</td><td>0.97</td><td>0.89</td><td>0.77</td><td>0.88</td><td>0.93</td><td>0.82</td><td>0.81</td><td>0.90</td><td></td></tr></tbody></table>

<table><thead><tr><th rowspan="3">Network</th><th colspan="10">Weighted Kendall's τ</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="3">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>0.89</td><td>0.73</td><td>0.95</td><td>0.91</td><td>0.65</td><td>0.86</td><td>0.88</td><td>0.79</td><td>0.75</td><td>0.92</td><td></td></tr><tr><td>Venice</td><td>0.92</td><td>0.80</td><td>0.94</td><td>0.90</td><td>0.73</td><td>0.86</td><td>0.88</td><td>0.86</td><td>0.87</td><td>0.94</td><td></td></tr><tr><td>Bordeaux</td><td>0.92</td><td>0.85</td><td>0.98</td><td>0.93</td><td>0.82</td><td>0.92</td><td>0.94</td><td>0.87</td><td>0.87</td><td>0.94</td><td></td></tr><tr><td>Berlin</td><td>0.86</td><td>0.80</td><td>0.96</td><td>0.91</td><td>0.62</td><td>0.75</td><td>0.86</td><td>0.83</td><td>0.81</td><td>0.91</td><td></td></tr><tr><td>Rome</td><td>0.91</td><td>0.83</td><td>0.98</td><td>0.92</td><td>0.73</td><td>0.89</td><td>0.94</td><td>0.85</td><td>0.85</td><td>0.92</td><td></td></tr><tr><td>Paris</td><td>0.96</td><td>0.91</td><td>0.99</td><td>0.96</td><td>0.89</td><td>0.95</td><td>0.97</td><td>0.92</td><td>0.92</td><td>0.97</td><td></td></tr></tbody></table>

<table><caption>Table 25: $\beta = \infty$ and Kendall, weighted Kendall, and intersection correlation</caption><thead><tr><th rowspan="3">Network</th><th colspan="10">Intersection top-100</th></tr><tr><th colspan="4">Fa</th><th colspan="4">Fo</th><th colspan="3">Sh</th><th>SFa</th></tr><tr><th>Fo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>Sh</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th><th>SFa</th><th>SFo</th></tr></thead><tbody><tr><td>Kuopio</td><td>80</td><td>60</td><td>94</td><td>85</td><td>52</td><td>75</td><td>75</td><td>63</td><td>67</td><td>88</td><td></td></tr><tr><td>Venice</td><td>77</td><td>55</td><td>78</td><td>73</td><td>42</td><td>62</td><td>62</td><td>70</td><td>71</td><td>86</td><td></td></tr><tr><td>Bordeaux</td><td>78</td><td>65</td><td>96</td><td>86</td><td>65</td><td>81</td><td>83</td><td>69</td><td>71</td><td>90</td><td></td></tr><tr><td>Berlin</td><td>73</td><td>53</td><td>92</td><td>86</td><td>42</td><td>70</td><td>68</td><td>55</td><td>58</td><td>91</td><td></td></tr><tr><td>Rome</td><td>59</td><td>50</td><td>83</td><td>60</td><td>30</td><td>48</td><td>59</td><td>58</td><td>48</td><td>64</td><td></td></tr><tr><td>Paris</td><td>70</td><td>53</td><td>96</td><td>81</td><td>46</td><td>68</td><td>80</td><td>54</td><td>50</td><td>83</td><td></td></tr></tbody></table>
References

[1] Alex Bavelas. Communication patterns in task-oriented groups. *The journal of the acoustical society of America*, 22(6):725–730, 1950.

[2] Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, and Bojana Kodric. Proxying betweenness centrality rankings in temporal networks. In *21st International Symposium on Experimental Algorithms*, volume 265 of LIPIcs, pages 6:1–6:22, 2023.

[3] Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, and Bojana Kodric. TSBProxy. https://github.com/piluc/TSBProxy, last checked on October 13, 2023.

[4] Ferenc Béres, Róbert Pálovics, Anna Oláh, and András A Benczúr. Temporal walk based centrality metric for graph streams. *Applied network science*, 3(1):32:1–32:26, 2018.

[5] Paolo Boldi, Massimo Santini, and Sebastiano Vigna. Crawdad. https://law.di.unimi.it, last checked on December 31, 2023.

[6] Michele Borassi and Emanuele Natale. KADABRA is an adaptive algorithm for betweenness via random approximation. *ACM J. Exp. Algorithmics*, 24(1):1.2:1–1.2:35, 2019.

[7] Ulrik Brandes. A faster algorithm for betweenness centrality. *Journal of mathematical society*, 25(2):163–177, 2001.

[8] Filippo Brunelli, Pierluigi Crescenzi, and Laurent Viennot. On computing Pareto optimal paths in weighted time-dependent networks. *Inf. Process. Lett.*, 168:106086, 2021.

[9] Filippo Brunelli and Laurent Viennot. Minimum-cost temporal walks under waiting-time constraints in linear time. *CoRR*, abs/2211.12136, 2022. arXiv:2211.12136, doi:10.48550/arXiv.2211.12136.

[10] Binh-Minh Bui-Xuan, Afonso Ferreira, and Aubin Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. *Int. J. Found. Comput. Sci.*, 14(2):267–285, 2003.

[11] Sebastian Buß, Hendrik Molter, Rolf Niedermeier, and Maciej Rymar. Algorithmic aspects of temporal betweenness. In Rajesh Gupta, Yan Liu, Jiliang Tang, and B. Aditya Prakash, editors, *KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23-27, 2020*, pages 2084–2092. ACM, 2020. doi: 10.1145/3394486.3403259.

[12] Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. *IJPEDS*, 27(5):387–408, 2012.

[13] Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. *Algorithmica*, 83(9):2754–2802, 2021.

[14] Ciro Cattuto and Alain Barrat. SocioPatterns. https://www.sociopatterns.org/, last checked on October 4, 2022.

[15] Pierluigi Crescenzi, Clémence Magnien, and Andrea Marino. Approximating the temporal neighbourhood function of large temporal graphs. *Algorithms*, 12(10):211, 2019.

[16] Pierluigi Crescenzi, Clémence Magnien, and Andrea Marino. Finding top-k nodes for temporal closeness in large temporal graphs. *Algorithms*, 13(9):211, 2020.

[17] Antonio Cruciani. Mantra: Temporal betweenness centrality approximation through sampling, 2024. arXiv:2304.08356.

[18] James Fairbanks, Mathieu Besançon, Schölly Simon, Júlio Hoffiman, Nick Eubank, and Stefan Karpinski. JuliaGraphs/Graphs.jl: an optimized graphs package for the Julia programming language. https://github.com/JuliaGraphs/Graphs.jl, last checked on February 4, 2024.
[19] Lucia Falzon, Eric Quintane, John Dunn, and Garry Robins. Embedding time in positions: Temporal measures of centrality for social network analysis. *Social Networks*, 54:168–178, 2018.

[20] Afonso Ferreira. Building a reference combinatorial model for manets. *IEEE Netw.*, 18(5):24–29, 2004.

[21] Luca Foschini, John Hershberger, and Subhash Suri. On the Complexity of Time-Dependent Shortest Paths. *Algorithmica*, 68(4):1075–1097, 2014.

[22] Linton C. Freeman. A set of measures of centrality based on betweenness. *Sociometry*, 40(1):35–41, March 1977. URL: http://dx.doi.org/10.2307/3033543, doi:10.2307/3033543.

[23] Marwan Ghanem, Florent Coriat, and Lionel Tabourier. Ego-betweenness centrality in link streams. In *Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017*, Sydney, Australia, July 31 - August 03, 2017, pages 667–674. ACM, 2017.

[24] Petter Holme. Modern temporal network theory: a colloquium. *The European Physical Journal B*, 88:234, 2015.

[25] Maurice G Kendall. A new measure of rank correlation. *Biometrika*, 30(1/2):81–93, 1938.

[26] R. Kujala, C. Weckström, R. Darst, M. Madlenocić, and J. Saramäki. A collection of public transport network data sets for 25 cities. *Sci. Data*, 5:article number: 180089, 2018.

[27] J. Kunegis. The KONECT Project. http://konect.cc, last checked on October 4, 2022.

[28] Matthieu Latapy, Tiphaine Viard, and Clémence Magnien. Stream graphs and link streams for the modeling of interactions over time. *Soc. Netw. Anal. Min.*, 8(1):61:1–61:29, 2018.

[29] Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, last checked on October 4, 2022.

[30] Laishui Lv, Kun Zhang, Ting Zhang, Dalal Bardou, Jiahui Zhang, and Ying Cai. Pagerank centrality for temporal networks. *Physics Letters A*, 383(12):1215–1222, 2019.

[31] O. Michail. An introduction to temporal graphs: An algorithmic perspective. *Internet Mathematics*, 12(4):239–280, 2016.

[32] Jacob Moreno. *Who Shall Survive? A new approach to the problem of human interrelations*. Nervous and Mental Disease Publishing Co., 1934.

[33] Lutz Oettershagen and Petra Mutzel. Efficient top-k temporal closeness calculation in temporal networks. In *2020 IEEE International Conference on Data Mining (ICDM)*, pages 402–411. IEEE, 2020.

[34] Lutz Oettershagen, Petra Mutzel, and Nils M. Kriege. Temporal walk centrality: Ranking nodes in evolving networks. In *WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022*, pages 1640–1650. ACM, 2022.

[35] Matteo Riondato and Eli Upfal. ABRA: approximating betweenness centrality in static and dynamic graphs with rademacher averages. *ACM Trans. Knowl. Discov. Data*, 12(5):61:1–61:38, 2018. doi:10.1145/3208351.

[36] Ryan A. Rossi and Nesreen K. Ahmed. Network repository. https://networkrepository.com, last checked on October 4, 2022.
[37] Polina Rozenshtein and Aristides Gionis. Temporal pagerank. In *Joint European Conference on Machine Learning and Knowledge Discovery in Databases*, pages 674–689. Springer, 2016.

[38] Maciej Rymar, Hendrik Molter, André Nichterlein, and Rolf Niedermeier. Towards classifying the polynomial-time solvability of temporal betweenness centrality. *J. Graph Algorithms Appl.*, 27(3):173–194, 2023.

[39] Diego Santoro and Ilie Sarpe. ONBRA: rigorous estimation of the temporal betweenness centrality in temporal networks. In *WWW ’22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022*, pages 1579–1588. ACM, 2022.

[40] Diego Santoro and Ilie Sarpe. ONBRA: rigorous estimation of the temporal betweenness centrality in temporal networks. https://github.com/iliesarpe/onbra, last checked on January 22, 2024.

[41] Nicola Santoro, Walter Quattrociocchi, Paola Flocchini, Arnaud Casteigts, and Frédéric Amblard. Time-varying graphs and social network analysis: Temporal indicators and metrics. *CoRR*, abs/1102.0629, 2011.

[42] David Schoch. Periodic table of network centrality. http://schochastics.net/sna/periodic.html, last checked on February 5, 2024.

[43] David Schoch, Thomas W. Valente, and Ulrik Brandes. Correlations among centrality indices and a class of uniquely ranked graphs. *Soc. Networks*, 50:46–54, 2017.

[44] Frédéric Simard, Clémence Magnien, and Matthieu Latapy. Computing betweenness centrality in link streams. *J. Graph Algorithms Appl.*, 27(3):195–217, 2023.

[45] João L. Sobrinho. An algebraic theory of dynamic network routing. *IEEE/ACM Trans. Netw.*, 13(5):1160–1173, 2005.

[46] João L. Sobrinho and Timothy G. Griffin. Routing in equilibrium. In *19th International Symposium on Mathematical Theory of Networks and System*, pages 941–947, 2010.

[47] Ioanna Tsalouchidou, Ricardo Baeza-Yates, Francesco Bonchi, Kewen Liao, and Timos Sellis. Temporal betweenness centrality in dynamic graphs. *Int. J. Data Sci. Anal.*, 9(3):257–272, 2020.

[48] Sebastiano Vigna. A weighted correlation index for rankings with ties. In Aldo Gangemi, Stefano Leonardi, and Alessandro Panconesi, editors, *Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015*, pages 1166–1176. ACM, 2015. doi:10.1145/2736277.2741088.

[49] Huanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, and Hejun Wu. Efficient algorithms for temporal path computation. *IEEE Trans. Knowl. Data Eng.*, 28(11):2927–2942, 2016.

[50] Tianming Zhang, Yunjun Gao, Jie Zhao, Lu Chen, Lu Jin, Zhengyi Yang, Bin Cao, and Jing Fan. Efficient exact and approximate betweenness centrality computation for temporal graphs. In *Proceedings of the ACM on Web Conference 2024*, page 2395–2406, 2024.