1 paper
N. E. Clarke, K. L. Collins, M. E. Messinger +2
We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our…