Fig. 4From: Counting motifs in dynamic networksEffect of network models on the running time. The three models are (i) Erdös-Rényi (ER), ii) Watts-Strogatz (WS) and (iii) Barabási-Albert (BA). The lower dotted line represents the running time for the static algorithm and the upper dotted line represents the twice the running time for the static algorithm. The solid line shows the running time for our dynamic algorithm as it computes the counts of the initial network and then updates them as the network evolves from G0 to G1000. a ER, b WS, c BABack to article page