Efficient approaches for attaining epidemic-free networks with minimum edge removal set (Q6183837)

This paper studies efficient approaches for attaining epidemic-free networks with minimum edge removal set. It presents three edge removal strategies to cope with the epidemic containment problem. It obtain the removal edge set through simultaneously optimizing the epidemic threshold and the largest connected component of the remaining network. It shows superiority in the containment of epidemics of different spread efficiencies. A bound strategy is also introduced to scale up the proposed methods to make them effective to deal with large-scale networks. Some experiments are presented to evaluate the effectiveness of the methods on synthetic and empirical networks.