Optimal giant component removal — greedy vs decycling vs random
Nodes removed: 0 | Giant: — | Method: degree
Network dismantling seeks the minimum node set whose removal destroys the giant connected component. Decycling (removing nodes that break cycles, targeting the 2-core) is near-optimal. Greedy high-degree removal is competitive but suboptimal. Random removal requires far more deletions. The efficiency ratio (nodes to remove / N) determines network resilience to targeted attacks.