In Landau notation, the computational complexity required for the network size m was O(m^1.5) until the 2000s, but in 2004 it became O(m^1.33), and in Kin's algorithm, the computational complexity ...