Fig. 3From: ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologiesThe overlap graph \(\bar {G^{o}}\) of the deterministic network Go (Fig. 1a) for its six embeddings (Fig. 1c-h)Back to article page