Fig. 4From: ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologiesThe bipartite graph G4 of the embedding H4. Each x i denotes the variable for each node in \(\mathcal {V}_{1}\). Each Z j represents the edge polynomial for each node in \(\mathcal {V}_{2}\)Back to article page