Skip to main content
. 2016 Oct 18;113(44):12368–12373. doi: 10.1073/pnas.1605083113

Fig. 1.

Fig. 1.

Fraction of nodes in the largest component as a function of the fraction of removed nodes for an ER random graph of average degree d=3.5 and size N=78,125. We compare the result of our Min-Sum algorithm (MS) with random (RND), adaptive largest degree (DEG), adaptive EC, adaptive CI centrality, and SA.