Fig. 10From: The spring bounces back: introducing the strain elevation tension spring embedding algorithm for network representationThe per-iteration complexity is linear for SETSe; however, the complexity of the total time to convergence is closer to quadratic. Memory complexity is linear and substantially lower than in the other methodsBack to article page