A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Partial immunization of trees
2020
Discrete Optimization
For a graph G and a non-negative integer-valued function τ on its vertex set, a dynamic monopoly is a set of vertices of G such that iteratively adding to it vertices u of G that have at least τ (u) neighbors in it eventually yields the vertex set of G. We study the problem of maximizing the minimum order of a dynamic monopoly by increasing the threshold values of individual vertices subject to vertex-dependent lower and upper bounds, and fixing the total increase. We solve this problem
doi:10.1016/j.disopt.2020.100568
fatcat:gaezttkkengahk3tb7yyd7coee