Next, we introduce a new, simple, one-step algorithm for constructing a connected DS, that we call ''DS-DC'': it starts with S~V , selects a node u with the minimum degree in G½S, removes u from S only if the DS defined on S\fug remains a connected DS of G, and repeats the above steps for all nodes in S in order of their increasing degrees. An illustration is presented in Figure 4 B. Clearly, DS-DC is much simpler than DS-RAI. Also, as illustrated in Figure 4 , DS-DC results in a smaller DS than DS-RAI (the same holds for real-world PPI networks, as demonstrated in Section 0). Finally, we introduce a modification of DS-DC in which nodes from S are visited in order of their increasing GDCs instead of degrees, which we call ''DS-GDC'' algorithm.