Enhancing Controllability Robustness of -Snapback Networks through Redirecting Edges
Three networks (A, B, and C) under a node-removal attack. The node-removal order for each network is based on the outdegrees, descending from large to small. When there is more than one node having the maximum outdegree, it randomly picks one among them. For networks A and B, the node-removal order is 1, 2, and 3; for network C, the order is 3, 4, and 1. The density of driver-nodes (), the number of nodes (), and the number of minimal driver-nodes needed () are also presented. The corresponding comparison is shown in Figure 4.