Fig. 1.

Schematic illustrating network-based fragmentation algorithms. All four strategies begin with the random choice of a node (step 1), before proceeding to step 2, at which one of four strategies can be chosen. Strategies A and B are acquaintance strategies, which entail choosing a random neighbor or a random neighbor with degree ≥2 of the node chosen in step 1. Strategies C and D are acquaintance-degree strategies. A random neighbor with degree greater than the original node (C) or the neighbor with highest degree (D) is chosen. A random choice is made between two nodes of equal highest degree.