Figure 2. Comparison of the model in Ref. 8 (i) with the MDS model (ii) for bipartite networks.

In this example, {b} is the dominating set (i.e., set cover) of G(, ; E), whereas {a^R, b^R, c^R} cannot appear in the maximum matching of G′(V^L, V^R; E′) and thus {a, b, c} must be the set of driver nodes in the sense of Ref. 8. We see that the MDS approach requires fewer driver nodes (only b) than Ref. 8 to structurally control the network.