Greedy sequential attack: the attack that chooses the

largest-degreed live node adjacent to the node crashed in

the last step as its next-step target. If no neighborhood live

node exists, it randomly selects a live node as its target.

• Coordinated attack: the attack that searches through all

the live nodes adjacent to any crashed node and selects

among them the largest-degreed one as its next-step target.

If no such node exists, it randomly selects a live node to

continue the attack.

• Lower-bounded parallel attack: instead of taking down

only a single node each step, it takes down in each step all

those live nodes that are (i) adjacent to the crashed nodes,

and (ii) with nodal degrees higher than a preset threshold. If

no such node exists, the attack stops.