Fig. 5From: Comparative analysis of box-covering algorithms for fractal networksThe mean \(N_B\) against \(l_B\) computed on the Tokyo metro network with five different algorithms. The inset plot shows the corresponding \(\Delta {\overline{N}}_B (l_B)\) values, which are the difference of the mean \(N_B\) and the minimum of the 15 boxing of the greedy algorithmBack to article page